IDEAS home Printed from https://ideas.repec.org/p/oxf/wpaper/570.html
   My bibliography  Save this paper

Stochastic Learning Dynamics and Speed of Convergence in Population Games

Author

Listed:
  • Itai Arieli
  • H Peyton Young

Abstract

Consider a finite, normal form game G in which each player position is occupied by a population of N individuals, and the payoff to any given individual is the expected payoff from playing against a group drawn at random from the other positions. Assume that individuals adjust their behavior asynchronously via a stochastic better reply dynamic. We show that when G is weakly acyclic, convergence occurs with probability one, but the expected waiting time to come close to Nash equilibrium can grow exponentially in N. Unlike previous results in the literature our results show that Nash convergence can be exponentially slow even in games with very simple payoff structures. We then show that the introduction of aggregate shocks to players' information and/or payoffs can greatly accelerate the learning process. In fact, if G is weakly acyclic and the payoffs are generic, the expected waiting time to come e-close to Nash equilibrium is bounded by a function that is polynomial e-1, exponential in the number of strategies, and independent of the population size N.

Suggested Citation

  • Itai Arieli & H Peyton Young, 2011. "Stochastic Learning Dynamics and Speed of Convergence in Population Games," Economics Series Working Papers 570, University of Oxford, Department of Economics.
    • Handle: RePEc:oxf:wpaper:570
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. , & , H., 2011. "Survival of dominated strategies under evolutionary dynamics," Theoretical Economics, Econometric Society, vol. 6(3), September.
    2. Sergiu Hart & Andreu Mas-Colell, 2013. "Stochastic Uncoupled Dynamics And Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 8, pages 165-189, World Scientific Publishing Co. Pte. Ltd..
    3. Sandholm, William H., 2009. "Large population potential games," Journal of Economic Theory, Elsevier, vol. 144(4), pages 1710-1725, July.
    4. Young, H Peyton, 1993. "The Evolution of Conventions," Econometrica, Econometric Society, vol. 61(1), pages 57-84, January.
    5. Michel BenaÔm & J–rgen W. Weibull, 2003. "Deterministic Approximation of Stochastic Evolution in Games," Econometrica, Econometric Society, vol. 71(3), pages 873-903, May.
    6. Sergiu Hart & Yishay Mansour, 2013. "How Long To Equilibrium? The Communication Complexity Of Uncoupled Equilibrium Procedures," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 10, pages 215-249, World Scientific Publishing Co. Pte. Ltd..
    7. Hofbauer, Josef & Sandholm, William H., 2007. "Evolution in games with randomly disturbed payoffs," Journal of Economic Theory, Elsevier, vol. 132(1), pages 47-69, January.
    8. Germano, Fabrizio & Lugosi, Gabor, 2007. "Global Nash convergence of Foster and Young's regret testing," Games and Economic Behavior, Elsevier, vol. 60(1), pages 135-154, July.
    9. Michael J. Smith, 1984. "The Stability of a Dynamic Model of Traffic Assignment---An Application of a Method of Lyapunov," Transportation Science, INFORMS, vol. 18(3), pages 245-252, August.
    10. 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.
    11. , P. & , Peyton, 2006. "Regret testing: learning to play Nash equilibrium without knowing you have an opponent," Theoretical Economics, Econometric Society, vol. 1(3), pages 341-367, September.
    12. Sergiu Hart & Andreu Mas-Colell, 2013. "Uncoupled Dynamics Do Not Lead To Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 7, pages 153-163, World Scientific Publishing Co. Pte. Ltd..
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Babichenko, Yakov, 2013. "Best-reply dynamics in large binary-choice anonymous games," Games and Economic Behavior, Elsevier, vol. 81(C), pages 130-144.

    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. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    2. Young, H. Peyton, 2009. "Learning by trial and error," Games and Economic Behavior, Elsevier, vol. 65(2), pages 626-643, March.
    3. Pradelski, Bary S.R. & Young, H. Peyton, 2012. "Learning efficient Nash equilibria in distributed systems," Games and Economic Behavior, Elsevier, vol. 75(2), pages 882-897.
    4. Sandholm, William H., 2015. "Population Games and Deterministic Evolutionary Dynamics," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. Babichenko, Yakov, 2012. "Completely uncoupled dynamics and Nash equilibria," Games and Economic Behavior, Elsevier, vol. 76(1), pages 1-14.
    6. Yakov Babichenko, 2010. "Completely Uncoupled Dynamics and Nash Equilibria," Discussion Paper Series dp529, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    7. Sergiu Hart & Yishay Mansour, 2013. "How Long To Equilibrium? The Communication Complexity Of Uncoupled Equilibrium Procedures," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 10, pages 215-249, World Scientific Publishing Co. Pte. Ltd..
    8. Burkhard C. Schipper, 2022. "Strategic Teaching and Learning in Games," American Economic Journal: Microeconomics, American Economic Association, vol. 14(3), pages 321-352, August.
    9. Babichenko, Yakov & Rubinstein, Aviad, 2022. "Communication complexity of approximate Nash equilibria," Games and Economic Behavior, Elsevier, vol. 134(C), pages 376-398.
    10. Yakov Babichenko, 2012. "Best-Reply Dynamics in Large Anonymous Games," Discussion Paper Series dp600, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    11. Foster, Dean P. & Hart, Sergiu, 2018. "Smooth calibration, leaky forecasts, finite recall, and Nash dynamics," Games and Economic Behavior, Elsevier, vol. 109(C), pages 271-293.
    12. Germano, Fabrizio & Lugosi, Gabor, 2007. "Global Nash convergence of Foster and Young's regret testing," Games and Economic Behavior, Elsevier, vol. 60(1), pages 135-154, July.
    13. Nax, Heinrich H., 2015. "Equity dynamics in bargaining without information exchange," LSE Research Online Documents on Economics 65426, London School of Economics and Political Science, LSE Library.
    14. Heinrich Nax & Bary Pradelski, 2015. "Evolutionary dynamics and equitable core selection in assignment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 903-932, November.
    15. Heinrich Nax, 2015. "Equity dynamics in bargaining without information exchange," Journal of Evolutionary Economics, Springer, vol. 25(5), pages 1011-1026, November.
    16. Burkhard Schipper, 2015. "Strategic teaching and learning in games," Working Papers 151, University of California, Davis, Department of Economics.
    17. Tom Johnston & Michael Savery & Alex Scott & Bassel Tarbush, 2023. "Game Connectivity and Adaptive Dynamics," Papers 2309.10609, arXiv.org, revised Oct 2024.
    18. Marden, Jason R. & Shamma, Jeff S., 2015. "Game Theory and Distributed Control****Supported AFOSR/MURI projects #FA9550-09-1-0538 and #FA9530-12-1-0359 and ONR projects #N00014-09-1-0751 and #N0014-12-1-0643," Handbook of Game Theory with Economic Applications,, Elsevier.
    19. Mäs, Michael & Nax, Heinrich H., 2016. "A behavioral study of “noise” in coordination games," LSE Research Online Documents on Economics 65422, London School of Economics and Political Science, LSE Library.
    20. Mäs, Michael & Nax, Heinrich H., 2016. "A behavioral study of “noise” in coordination games," Journal of Economic Theory, Elsevier, vol. 162(C), pages 195-208.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:oxf:wpaper:570. 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: Anne Pouliquen (email available below). General contact details of provider: https://edirc.repec.org/data/sfeixuk.html .

    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.