IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v76y2010i1p69-85.html
   My bibliography  Save this article

Scale-free memory model for multiagent reinforcement learning. Mean field approximation and rock-paper-scissors dynamics

Author

Listed:
  • I. Lubashevsky
  • S. Kanemoto

Abstract

No abstract is available for this item.

Suggested Citation

  • I. Lubashevsky & S. Kanemoto, 2010. "Scale-free memory model for multiagent reinforcement learning. Mean field approximation and rock-paper-scissors dynamics," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 76(1), pages 69-85, July.
    • Handle: RePEc:spr:eurphb:v:76:y:2010:i:1:p:69-85
    DOI: 10.1140/epjb/e2010-00201-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2010-00201-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1140/epjb/e2010-00201-8?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 & Levine, David, 1998. "Learning in games," European Economic Review, Elsevier, vol. 42(3-5), pages 631-639, May.
    2. Drew Fudenberg & David M. Kreps & Eric S. Maskin, 1990. "Repeated Games with Long-run and Short-run Players," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 57(4), pages 555-573.
    3. Drew Fudenberg & Eric Maskin, 1998. "The Folk Theorem for Repeated Games with Discounting and Incomplete Information," Levine's Working Paper Archive 224, David K. Levine.
    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.
    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. W. Hichri & A. Kirman, 2007. "The emergence of coordination in public good games," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 55(2), pages 149-159, January.
    2. M. Sysi-Aho & J. Saramäki & J. Kertész & K. Kaski, 2005. "Spatial snowdrift game with myopic agents," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 44(1), pages 129-135, March.
    3. Chen, Yan & Jiang, Ming & Kesten, Onur & Robin, Stéphane & Zhu, Min, 2018. "Matching in the large: An experimental study," Games and Economic Behavior, Elsevier, vol. 110(C), pages 295-317.
    4. Schipper, Burkhard C, 2011. "Strategic control of myopic best reply in repeated games," MPRA Paper 30219, University Library of Munich, Germany.
    5. Burkhard C. Schipper, 2019. "Dynamic Exploitation of Myopic Best Response," Dynamic Games and Applications, Springer, vol. 9(4), pages 1143-1167, December.
    6. repec:cla:levarc:786969000000001297 is not listed on IDEAS
    7. Zhijian Wang & Yanran Zhou & Jaimie W. Lien & Jie Zheng & Bin Xu, 2016. "Extortion Can Outperform Generosity in the Iterated Prisoners' Dilemma," Levine's Bibliography 786969000000001297, UCLA Department of Economics.
    8. Anna Cartwright & Edward Cartwright, 2019. "Ransomware and Reputation," Games, MDPI, vol. 10(2), pages 1-14, June.
    9. Galbiati, Marco & Soramäki, Kimmo, 2011. "An agent-based model of payment systems," Journal of Economic Dynamics and Control, Elsevier, vol. 35(6), pages 859-875, June.
    10. Laurent Lamy, 2013. "“Upping the ante”: how to design efficient auctions with entry?," RAND Journal of Economics, RAND Corporation, vol. 44(2), pages 194-214, June.
    11. Ianni, A., 2002. "Reinforcement learning and the power law of practice: some analytical results," Discussion Paper Series In Economics And Econometrics 203, Economics Division, School of Social Sciences, University of Southampton.
    12. ,, 2011. "Manipulative auction design," Theoretical Economics, Econometric Society, vol. 6(2), May.
    13. Benaïm, Michel & Hofbauer, Josef & Hopkins, Ed, 2009. "Learning in games with unstable equilibria," Journal of Economic Theory, Elsevier, vol. 144(4), pages 1694-1709, July.
    14. Dieter Balkenborg & Rosemarie Nagel, 2016. "An Experiment on Forward vs. Backward Induction: How Fairness and Level k Reasoning Matter," German Economic Review, Verein für Socialpolitik, vol. 17(3), pages 378-408, August.
    15. William L. Cooper & Tito Homem-de-Mello & Anton J. Kleywegt, 2015. "Learning and Pricing with Models That Do Not Explicitly Incorporate Competition," Operations Research, INFORMS, vol. 63(1), pages 86-103, February.
    16. Siegfried Berninghaus & Werner Güth & M. Vittoria Levati & Jianying Qiu, 2006. "Satisficing in sales competition: experimental evidence," Papers on Strategic Interaction 2006-32, Max Planck Institute of Economics, Strategic Interaction Group.
    17. Ball, Richard, 2017. "Violations of monotonicity in evolutionary models with sample-based beliefs," Economics Letters, Elsevier, vol. 152(C), pages 100-104.
    18. Tsakas, Elias & Voorneveld, Mark, 2009. "The target projection dynamic," Games and Economic Behavior, Elsevier, vol. 67(2), pages 708-719, November.
    19. Sandholm,W.H., 2003. "Excess payoff dynamics, potential dynamics, and stable games," Working papers 5, Wisconsin Madison - Social Systems.
    20. Yoo, Seung Han, 2014. "Learning a population distribution," Journal of Economic Dynamics and Control, Elsevier, vol. 48(C), pages 188-201.
    21. Anthony Ziegelmeyer & Frédéric Koessler & Kene Boun My & Laurent Denant-Boèmont, 2008. "Road Traffic Congestion and Public Information: An Experimental Investigation," Journal of Transport Economics and Policy, University of Bath, vol. 42(1), pages 43-82, January.

    More about this item

    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:spr:eurphb:v:76:y:2010:i:1:p:69-85. 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.