A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
Author
Abstract
Suggested Citation
DOI: 10.1016/j.jet.2023.105713
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Borgs, Christian & Chayes, Jennifer & Immorlica, Nicole & Kalai, Adam Tauman & Mirrokni, Vahab & Papadimitriou, Christos, 2010. "The myth of the Folk Theorem," Games and Economic Behavior, Elsevier, vol. 70(1), pages 34-43, September.
- Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
- Halpern, Joseph Y. & Pass, Rafael & Seeman, Lior, 2019. "The truth behind the myth of the Folk theorem," Games and Economic Behavior, Elsevier, vol. 117(C), pages 479-498.
- Nachbar, John H & Zame, William R, 1996.
"Non-computable Strategies and Discounted Repeated Games,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
- William R. Zame & John H. Nachbar, 1996. "Non-computable strategies and discounted repeated games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122.
- William R. Zame, 1995. "Non-Computable Strategies and Discounted Repeated Games," UCLA Economics Working Papers 735, UCLA Department of Economics.
- Kam-Chau Wong & Marcel K. Richter, 1999. "Non-computability of competitive equilibrium," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 14(1), pages 1-27.
- Knoblauch Vicki, 1994. "Computable Strategies for Repeated Prisoner's Dilemma," Games and Economic Behavior, Elsevier, vol. 7(3), pages 381-389, November.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(3), pages 309-325.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Martin J. Osborne & Ariel Rubinstein, 1994.
"A Course in Game Theory,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262650401, December.
- Martin J Osborne & Ariel Rubinstein, 2009. "A Course in Game Theory," Levine's Bibliography 814577000000000225, UCLA Department of Economics.
- Gilboa, Itzhak, 1988.
"The complexity of computing best-response automata in repeated games,"
Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
- Itzhak Gilboa, 1988. "The Complexity of Computing Best-Response Automata in Repeated Games," Post-Print hal-00756286, HAL.
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.- Jakub Dargaj & Jakob Grue Simonsen, 2020. "A Complete Characterization of Infinitely Repeated Two-Player Games having Computable Strategies with no Computable Best Response under Limit-of-Means Payoff," Papers 2005.13921, arXiv.org, revised Jun 2020.
- Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
- Nachbar, John H & Zame, William R, 1996.
"Non-computable Strategies and Discounted Repeated Games,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
- William R. Zame & John H. Nachbar, 1996. "Non-computable strategies and discounted repeated games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122.
- William R. Zame, 1995. "Non-Computable Strategies and Discounted Repeated Games," UCLA Economics Working Papers 735, UCLA Department of Economics.
- Oliveira, Fernando S., 2010. "Limitations of learning in automata-based systems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 684-691, June.
- Compte, Olivier & Postlewaite, Andrew, 2015.
"Plausible cooperation,"
Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," Post-Print halshs-01204780, HAL.
- Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," PSE-Ecole d'économie de Paris (Postprint) halshs-01204780, HAL.
- Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
- Daijiro Okada & Abraham Neyman, 2004. "Growing Strategy Sets in Repeated Games," Econometric Society 2004 North American Summer Meetings 625, Econometric Society.
- João E. Gata, 2019. "Controlling Algorithmic Collusion: short review of the literature, undecidability, and alternative approaches," Working Papers REM 2019/77, ISEG - Lisbon School of Economics and Management, REM, Universidade de Lisboa.
- Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
- Joshua M. Epstein, 2007. "Agent-Based Computational Models and Generative Social Science," Introductory Chapters, in: Generative Social Science Studies in Agent-Based Computational Modeling, Princeton University Press.
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
- Sung, Shao Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Coalition Theory Network Working Papers 46655, Fondazione Eni Enrico Mattei (FEEM).
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Olivier Compte & Andrew Postlewaite, 2007.
"Effecting Cooperation,"
PIER Working Paper Archive
09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
- Olivier Compte & Andrew Postlewaite, 2010. "Plausible Cooperation,Third Version," PIER Working Paper Archive 13-008, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 01 Dec 2012.
- Andrew Postlewaite & Olivier Compte, 2009. "Plausible Cooperation, Second Version," PIER Working Paper Archive 10-039, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 16 Dec 2010.
- D. Sgroi & D. J. Zizzo, 2002. "Strategy Learning in 3x3 Games by Neural Networks," Cambridge Working Papers in Economics 0207, Faculty of Economics, University of Cambridge.
- Hernández, Penélope & Solan, Eilon, 2016.
"Bounded computational capacity equilibrium,"
Journal of Economic Theory, Elsevier, vol. 163(C), pages 342-364.
- Eilon Solan & Penélope Hernández, 2014. "Bounded Computational Capacity Equilibrium," Discussion Papers in Economic Behaviour 0314, University of Valencia, ERI-CES.
- Hernández, Penélope & Urbano, Amparo, 2008.
"Codification schemes and finite automata,"
Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
- Amparo Urbano Salvador & Penélope Hernández Rojas, 2000. "Codification schemes and finite automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Ying-Fang Kao & Ragupathy Venkatachalam, 2021. "Human and Machine Learning," Computational Economics, Springer;Society for Computational Economics, vol. 57(3), pages 889-909, March.
- Jihong Lee & Hamid Sabourian, 2005. "Efficiency in Negotiation: Complexity and Costly Bargaining," Birkbeck Working Papers in Economics and Finance 0505, Birkbeck, Department of Economics, Mathematics & Statistics.
- Shorish, Jamsheed, 2018. "Blockchain State Machine Representation," SocArXiv eusxg, Center for Open Science.
- Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in the Negotiation Game," Econometric Society 2004 North American Winter Meetings 82, Econometric Society.
More about this item
Keywords
Repeated games; Limit-of-means payoff; Computability; Best response strategies; Subgame-perfect equilibria;All these keywords.
JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
- Y80 - Miscellaneous Categories - - Related Disciplines - - - Related Disciplines
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:eee:jetheo:v:213:y:2023:i:c:s0022053123001096. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.