Chaotic and deterministic switching in a two-person game
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Berger, Ulrich, 2005. "Fictitious play in 2 x n games," Journal of Economic Theory, Elsevier, vol. 120(2), pages 139-154, February.
- Feltovich, Nick, 1999. "Equilibrium and reinforcement learning in private-information games: An experimental study," Journal of Economic Dynamics and Control, Elsevier, vol. 23(9-10), pages 1605-1632, September.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- van Strien, Sebastian & Sparrow, Colin, 2011. "Fictitious play in 3x3 games: Chaos and dithering behaviour," Games and Economic Behavior, Elsevier, vol. 73(1), pages 262-286, September.
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.- Fernando Lozano & Jaime Lozano & Mario García, 2007. "An artificial economy based on reinforcement learning and agent based modeling," Documentos de Trabajo 3907, Universidad del Rosario.
- Jiequn Han & Ruimeng Hu & Jihao Long, 2020. "Convergence of Deep Fictitious Play for Stochastic Differential Games," Papers 2008.05519, arXiv.org, revised Mar 2021.
- Jacquemet, Nicolas & Koessler, Frédéric, 2013.
"Using or hiding private information? An experimental study of zero-sum repeated games with incomplete information,"
Games and Economic Behavior, Elsevier, vol. 78(C), pages 103-120.
- Nicolas Jacquemet & Frédéric Koessler, 2011. "Using or Hiding Private Information? An experimental Study of Zero-Sum Repeated Games with Incomplete Information," Documents de travail du Centre d'Economie de la Sorbonne 11002, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Nicolas Jacquemet & Frédéric Koessler, 2013. "Using or Hiding Private Information? An Experimental Study of Zero-Sum Repeated Games with Incomplete Information," Post-Print halshs-00773412, HAL.
- Nicolas Jacquemet & Frédéric Koessler, 2013. "Using or Hiding Private Information? An Experimental Study of Zero-Sum Repeated Games with Incomplete Information," PSE-Ecole d'économie de Paris (Postprint) halshs-00773412, HAL.
- Nicolas Jacquemet & Frédéric Koessler, 2011. "Using or Hiding Private Information? An Experimental Study of Zero-Sum Repeated Games with Incomplete Information," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00565157, HAL.
- Nicolas Jacquemet & Frédéric Koessler, 2011. "Using or Hiding Private Information? An Experimental Study of Zero-Sum Repeated Games with Incomplete Information," Post-Print halshs-00565157, HAL.
- Berger, Ulrich & Hofbauer, Josef, 2006.
"Irrational behavior in the Brown-von Neumann-Nash dynamics,"
Games and Economic Behavior, Elsevier, vol. 56(1), pages 1-6, July.
- Ulrich Berger & Josef Hofbauer, 2004. "Irrational behavior in the Brown-von Neumann-Nash dynamics," Game Theory and Information 0409002, University Library of Munich, Germany, revised 09 Sep 2004.
- Ulrich Berger, 2004. "Some Notes on Learning in Games with Strategic Complementarities," Game Theory and Information 0409001, University Library of Munich, Germany.
- In, Younghwan, 2014. "Fictitious play property of the Nash demand game," Economics Letters, Elsevier, vol. 122(3), pages 408-412.
- Leslie, David S. & Collins, E.J., 2006. "Generalised weakened fictitious play," Games and Economic Behavior, Elsevier, vol. 56(2), pages 285-298, August.
- Nick Feltovich, 2000. "Reinforcement-Based vs. Belief-Based Learning Models in Experimental Asymmetric-Information," Econometrica, Econometric Society, vol. 68(3), pages 605-642, May.
- Andriy Zapechelnyuk, 2009. "Limit Behavior of No-regret Dynamics," Discussion Papers 21, Kyiv School of Economics.
- Robert Hoffmann, 2006. "The Cognitive Origins of Social Stratification," Computational Economics, Springer;Society for Computational Economics, vol. 28(3), pages 233-249, October.
- Ulrich Berger, 2012. "Non-algebraic Convergence Proofs for Continuous-Time Fictitious Play," Dynamic Games and Applications, Springer, vol. 2(1), pages 4-17, March.
- Shouqiang Wang & David Banks, 2011. "Network routing for insurgency: An adversarial risk analysis framework," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(6), pages 595-607, September.
- Francesco Caruso & Maria Carmela Ceparano & Jacqueline Morgan, 2020. "Best response algorithms in ratio-bounded games: convergence of affine relaxations to Nash equilibria," CSEF Working Papers 593, Centre for Studies in Economics and Finance (CSEF), University of Naples, Italy.
- Micola, Augusto Ruperez & Bunn, Derek W., 2008. "Crossholdings, concentration and information in capacity-constrained sealed bid-offer auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 66(3-4), pages 748-766, June.
- Ulrich Berger, 2004. "Two More Classes of Games with the Fictitious Play Property," Game Theory and Information 0408003, University Library of Munich, Germany.
- Viossat, Yannick & Zapechelnyuk, Andriy, 2013.
"No-regret dynamics and fictitious play,"
Journal of Economic Theory, Elsevier, vol. 148(2), pages 825-842.
- Yannick Viossat & Andriy Zapechelnyuk, 2013. "No-regret Dynamics and Fictitious Play," Post-Print hal-00713871, HAL.
- Mario Bravo & Mathieu Faure, 2013.
"Reinforcement Learning with Restrictions on the Action Set,"
AMSE Working Papers
1335, Aix-Marseille School of Economics, France, revised 01 Jul 2013.
- Mario Bravo & Mathieu Faure, 2015. "Reinforcement Learning with Restrictions on the Action Set," Post-Print hal-01457301, HAL.
- Elliott O. Wagner, 2013. "The Dynamics of Costly Signaling," Games, MDPI, vol. 4(2), pages 1-19, April.
- Berger, Ulrich, 2016.
"Learning to trust, learning to be trustworthy,"
Department of Economics Working Paper Series
212, WU Vienna University of Economics and Business.
- Ulrich Berger, 2016. "Learning to trust, learning to be trustworthy," Department of Economics Working Papers wuwp212, Vienna University of Economics and Business, Department of Economics.
- Simina Br^anzei & MohammadTaghi Hajiaghayi & Reed Phillips & Suho Shin & Kun Wang, 2024. "Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting," Papers 2402.08547, arXiv.org, revised Feb 2024.
More about this item
Keywords
learning process; dynamics; switching; chaos;All these keywords.
JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness
NEP fields
This paper has been announced in the following NEP Reports:- NEP-GTH-2009-01-03 (Game Theory)
Statistics
Access and download statisticsCorrections
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:por:fepwps:305. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/fepuppt.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.