IDEAS home Printed from https://ideas.repec.org/a/spr/jcsosc/v4y2021i2d10.1007_s42001-021-00109-9.html
   My bibliography  Save this article

Algorithms may not learn to play a unique Nash equilibrium

Author

Listed:
  • Takako Fujiwara-Greve

    (Keio University)

  • Carsten Krabbe Nielsen

    (Catholic University of Milan)

Abstract

There is a widespread hope that, in the near future, algorithms become so sophisticated that “solutions” to most problems are found by machines. In this note, we throw some doubts on this expectation by showing the following impossibility result: given a set of finite-memory, finite-iteration algorithms, a continuum of games exist, whose unique and strict Nash equilibrium cannot be reached from a large set of initial states. A Nash equilibrium is a social solution to conflicts of interest, and hence finite algorithms should not be always relied upon for social problems. Our result also shows how to construct games to deceive a given set of algorithms to be trapped in a cycle without a Nash equilibrium.

Suggested Citation

  • Takako Fujiwara-Greve & Carsten Krabbe Nielsen, 2021. "Algorithms may not learn to play a unique Nash equilibrium," Journal of Computational Social Science, Springer, vol. 4(2), pages 839-850, November.
    • Handle: RePEc:spr:jcsosc:v:4:y:2021:i:2:d:10.1007_s42001-021-00109-9
    DOI: 10.1007/s42001-021-00109-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s42001-021-00109-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s42001-021-00109-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fudenberg, Drew & Takahashi, Satoru, 2011. "Heterogeneous beliefs and local information in stochastic fictitious play," Games and Economic Behavior, Elsevier, vol. 71(1), pages 100-120, January.
    2. Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
    3. Basu, Kaushik & Weibull, Jorgen W., 1991. "Strategy subsets closed under rational behavior," Economics Letters, Elsevier, vol. 36(2), pages 141-146, June.
    4. Terri Kneeland, 2015. "Identifying Higher‐Order Rationality," Econometrica, Econometric Society, vol. 83(5), pages 2065-2079, September.
    5. Matros, Alexander, 2003. "Clever agents in adaptive learning," Journal of Economic Theory, Elsevier, vol. 111(1), pages 110-124, July.
    6. Kandori, Michihiro & Mailath, George J & Rob, Rafael, 1993. "Learning, Mutation, and Long Run Equilibria in Games," Econometrica, Econometric Society, vol. 61(1), pages 29-56, January.
    7. Nagel, Rosemarie, 1995. "Unraveling in Guessing Games: An Experimental Study," American Economic Review, American Economic Association, vol. 85(5), pages 1313-1326, December.
    8. Stahl, Dale O., 1996. "Boundedly Rational Rule Learning in a Guessing Game," Games and Economic Behavior, Elsevier, vol. 16(2), pages 303-330, October.
    9. Hurkens Sjaak, 1995. "Learning by Forgetful Players," Games and Economic Behavior, Elsevier, vol. 11(2), pages 304-329, November.
    10. Mohlin, Erik, 2012. "Evolution of theories of mind," Games and Economic Behavior, Elsevier, vol. 75(1), pages 299-318.
    11. Fudenberg Drew & Kreps David M., 1993. "Learning Mixed Equilibria," Games and Economic Behavior, Elsevier, vol. 5(3), pages 320-367, July.
    12. Foster, Dean P. & Young, H. Peyton, 2003. "Learning, hypothesis testing, and Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 45(1), pages 73-96, October.
    13. Milgrom, Paul & Roberts, John, 1991. "Adaptive and sophisticated learning in normal form games," Games and Economic Behavior, Elsevier, vol. 3(1), pages 82-100, February.
    14. Stahl, Dale O., 2000. "Rule Learning in Symmetric Normal-Form Games: Theory and Evidence," Games and Economic Behavior, Elsevier, vol. 32(1), pages 105-138, July.
    15. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, March.
    16. Gilli, Mario, 2001. "A General Approach to Rational Learning in Games," Bulletin of Economic Research, Wiley Blackwell, vol. 53(4), pages 275-303, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Block, Juan I. & Fudenberg, Drew & Levine, David K., 2019. "Learning dynamics with social comparisons and limited memory," Theoretical Economics, Econometric Society, vol. 14(1), January.
    2. Nax, Heinrich Harald & Newton, Jonathan, 2022. "Deep and shallow thinking in the long run," Theoretical Economics, Econometric Society, vol. 17(4), November.
    3. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    4. Andriy Zapechelnyuk, 2009. "Limit Behavior of No-regret Dynamics," Discussion Papers 21, Kyiv School of Economics.
    5. Abhimanyu Khan & Ronald Peeters, 2014. "Cognitive hierarchies in adaptive play," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(4), pages 903-924, November.
    6. Juan I Block & Drew Fudenberg & David K Levine, 2017. "Learning Dynamics Based on Social Comparisons," Levine's Working Paper Archive 786969000000001375, David K. Levine.
    7. Josephson, Jens, 2009. "Stochastic adaptation in finite games played by heterogeneous populations," Journal of Economic Dynamics and Control, Elsevier, vol. 33(8), pages 1543-1554, August.
    8. Friedman, James W. & Mezzetti, Claudio, 2001. "Learning in Games by Random Sampling," Journal of Economic Theory, Elsevier, vol. 98(1), pages 55-84, May.
    9. Sandholm, William H., 2015. "Population Games and Deterministic Evolutionary Dynamics," Handbook of Game Theory with Economic Applications,, Elsevier.
    10. Jun Honda, 2015. "Games with the Total Bandwagon Property," Department of Economics Working Papers wuwp197, Vienna University of Economics and Business, Department of Economics.
    11. Hopkins, Ed, 1999. "Learning, Matching, and Aggregation," Games and Economic Behavior, Elsevier, vol. 26(1), pages 79-110, January.
    12. Mohlin, Erik, 2012. "Evolution of theories of mind," Games and Economic Behavior, Elsevier, vol. 75(1), pages 299-318.
    13. Ellison, Glenn, 1997. "Learning from Personal Experience: One Rational Guy and the Justification of Myopia," Games and Economic Behavior, Elsevier, vol. 19(2), pages 180-210, May.
    14. Nagel, Rosemarie & Bühren, Christoph & Frank, Björn, 2017. "Inspired and inspiring: Hervé Moulin and the discovery of the beauty contest game," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 191-207.
    15. Peyton Young, H., 1998. "Individual learning and social rationality1," European Economic Review, Elsevier, vol. 42(3-5), pages 651-663, May.
    16. , & , H. & ,, 2015. "Sampling best response dynamics and deterministic equilibrium selection," Theoretical Economics, Econometric Society, vol. 10(1), January.
    17. Wallace, Chris & Young, H. Peyton, 2015. "Stochastic Evolutionary Game Dynamics," Handbook of Game Theory with Economic Applications,, Elsevier.
    18. Blume, Andreas, 1998. "Communication, Risk, and Efficiency in Games," Games and Economic Behavior, Elsevier, vol. 22(2), pages 171-202, February.
    19. Hofbauer,J. & Sandholm,W.H., 2001. "Evolution and learning in games with randomly disturbed payoffs," Working papers 5, Wisconsin Madison - Social Systems.
    20. Roth, Alvin E. & Erev, Ido, 1995. "Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term," Games and Economic Behavior, Elsevier, vol. 8(1), pages 164-212.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcsosc:v:4:y:2021:i:2:d:10.1007_s42001-021-00109-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.