IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1507.05376.html
   My bibliography  Save this paper

The time scales of the aggregate learning and sorting in market entry games with large number of players

Author

Listed:
  • Misha Perepelitsa

Abstract

We consider the dynamics of player's strategies in repeated market games, where the selection of strategies is determined by a learning model. Prior theoretical analysis and experimental data show that after large number of plays the average number of agents who decide to enter, per round of the game, approaches the market capacity and, after a longer wait, agents are being sorted into two groups: the agents in one group rarely enter the market, and in the other, the agents enter almost all the time. In this paper we obtain estimates of the characteristic times it takes for both patterns to emerge in the repeated plays of the game. The estimates are given in terms of the parameters of the game, assuming that the number of agents is large, the number of rounds of the game per unit of time is large, and the characteristic change of the propensity per game is small. Our approach is based on the analysis of the partial differential equation for the function $f(t,q)$ that describes the distribution of agents according to their level of propensity to enter the market, $q,$ at time $t.$

Suggested Citation

  • Misha Perepelitsa, 2015. "The time scales of the aggregate learning and sorting in market entry games with large number of players," Papers 1507.05376, arXiv.org, revised Sep 2015.
    • Handle: RePEc:arx:papers:1507.05376
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1507.05376
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fudenberg, Drew & Levine, David, 1998. "Learning in games," European Economic Review, Elsevier, vol. 42(3-5), pages 631-639, May.
    2. Duffy, John & Hopkins, Ed, 2005. "Learning, information, and sorting in market entry games: theory and evidence," Games and Economic Behavior, Elsevier, vol. 51(1), pages 31-62, April.
    3. Erev, Ido & Roth, Alvin E, 1998. "Predicting How People Play Games: Reinforcement Learning in Experimental Games with Unique, Mixed Strategy Equilibria," American Economic Review, American Economic Association, vol. 88(4), pages 848-881, September.
    4. Drew Fudenberg & David K. Levine, 1998. "The Theory of Learning in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061945, December.
    5. Erev, Ido & Rapoport, Amnon, 1998. "Coordination, "Magic," and Reinforcement Learning in a Market Entry Game," Games and Economic Behavior, Elsevier, vol. 23(2), pages 146-175, May.
    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. Giovanna Devetag, 2000. "Coordination in "Critical Mass" Games: An Experimental Study," LEM Papers Series 2000/03, Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy.
    2. Willemien Kets, 2007. "The minority game: An economics perspective," Papers 0706.4432, arXiv.org.
    3. Duffy, John, 2006. "Agent-Based Models and Human Subject Experiments," Handbook of Computational Economics, in: Leigh Tesfatsion & Kenneth L. Judd (ed.), Handbook of Computational Economics, edition 1, volume 2, chapter 19, pages 949-1011, Elsevier.
    4. Kets, W., 2008. "Networks and learning in game theory," Other publications TiSEM 7713fce1-3131-498c-8c6f-3, Tilburg University, School of Economics and Management.
    5. Ed Hopkins, 2002. "Two Competing Models of How People Learn in Games," Econometrica, Econometric Society, vol. 70(6), pages 2141-2166, November.
    6. Hofbauer, Josef & Hopkins, Ed, 2005. "Learning in perturbed asymmetric games," Games and Economic Behavior, Elsevier, vol. 52(1), pages 133-152, July.
    7. Franke, Reiner, 2003. "Reinforcement learning in the El Farol model," Journal of Economic Behavior & Organization, Elsevier, vol. 51(3), pages 367-388, July.
    8. Dai Zusai, 2018. "Evolutionary dynamics in heterogeneous populations: a general framework for an arbitrary type distribution," Papers 1805.04897, arXiv.org, revised May 2019.
    9. Duffy, John & Hopkins, Ed, 2005. "Learning, information, and sorting in market entry games: theory and evidence," Games and Economic Behavior, Elsevier, vol. 51(1), pages 31-62, April.
    10. Ho, Teck H. & Camerer, Colin F. & Chong, Juin-Kuan, 2007. "Self-tuning experience weighted attraction learning in games," Journal of Economic Theory, Elsevier, vol. 133(1), pages 177-198, March.
    11. Thorsten Chmura & Werner Güth, 2011. "The Minority of Three-Game: An Experimental and Theoretical Analysis," Games, MDPI, vol. 2(3), pages 1-22, September.
    12. Erev, Ido & Bereby-Meyer, Yoella & Roth, Alvin E., 1999. "The effect of adding a constant to all payoffs: experimental investigation, and implications for reinforcement learning models," Journal of Economic Behavior & Organization, Elsevier, vol. 39(1), pages 111-128, May.
    13. Atanasios Mitropoulos, 2001. "Learning Under Little Information: An Experiment on Mutual Fate Control," Game Theory and Information 0110003, University Library of Munich, Germany.
    14. Ido Erev & Eyal Ert & Alvin E. Roth, 2010. "A Choice Prediction Competition for Market Entry Games: An Introduction," Games, MDPI, vol. 1(2), pages 1-20, May.
    15. Jim Engle-Warnick & Ed Hopkins, 2006. "A Simple Test of Learning Theory," Levine's Bibliography 321307000000000724, UCLA Department of Economics.
    16. George R. Neumann & Nathan E. Savin, 2000. "Learning and Communication in Sender-Receiver Games: An Econometric Investigation," Econometric Society World Congress 2000 Contributed Papers 1852, Econometric Society.
    17. Giovanna Devetag, 2003. "Coordination and Information in Critical Mass Games: An Experimental Study," Experimental Economics, Springer;Economic Science Association, vol. 6(1), pages 53-73, June.
    18. Shafran, Aric P., 2012. "Learning in games with risky payoffs," Games and Economic Behavior, Elsevier, vol. 75(1), pages 354-371.
    19. Ido Erev & Alvin Roth & Robert Slonim & Greg Barron, 2007. "Learning and equilibrium as useful approximations: Accuracy of prediction on randomly selected constant sum games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(1), pages 29-51, October.
    20. Wen, Yuanji, 2018. "Voluntary information acquisition in an asymmetric-Information game:comparing learning theories in the laboratory," Journal of Economic Behavior & Organization, Elsevier, vol. 150(C), pages 202-219.

    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:arx:papers:1507.05376. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.