Perceptron versus automaton in the finitely repeated prisoner’s dilemma
Author
Abstract
Suggested Citation
DOI: 10.1007/s11238-009-9158-y
Download full text from publisher
As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.
Other versions of this item:
- Sylvain Béal, 2010. "Perceptron versus Automaton in the Finitely Repeated Prisoner's Dilemma," Post-Print halshs-00530593, HAL.
References listed on IDEAS
- Jim Engle-Warnick & Robert Slonim, 2006.
"Inferring repeated-game strategies from actions: evidence from trust game experiments,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 28(3), pages 603-632, August.
- Jim Engle-Warnick & Robert L. Slonim, 2001. "Inferring Repeated Game Strategies From Actions: Evidence From Trust Game Experiments," Economics Papers 2001-W13, Economics Group, Nuffield College, University of Oxford.
- Rubinstein, Ariel, 1993.
"On Price Recognition and Computational Complexity in a Monopolistic Model,"
Journal of Political Economy, University of Chicago Press, vol. 101(3), pages 473-484, June.
- Rubenstein, A., 1991. "On Price Recognition and Computational Complexity in a Monopolistic Model," Papers 35-91, Tel Aviv.
- Rubinstein, Ariel, 1991. "On Price Recognition and Computational Complexity in a Monopolistic Model," Foerder Institute for Economic Research Working Papers 275520, Tel-Aviv University > Foerder Institute for Economic Research.
- Cho, In-Koo, 1996.
"On the Complexity of Repeated Principal Agent Games,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(1), pages 1-17, January.
- In-Koo Cho, 1995. "On the complexity of repeated principal agent games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(1), pages 1-17.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Cho, In-Koo, 1994. "Bounded Rationality, Neural Network and Folk Theorem in Repeated Games with Discounting," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 4(6), pages 935-957, October.
- Gilboa, Itzhak & Samet, Dov, 1989.
"Bounded versus unbounded rationality: The tyranny of the weak,"
Games and Economic Behavior, Elsevier, vol. 1(3), pages 213-221, September.
- Itzhak Gilboa & Dov Samet, 1989. "Bounded Versus Unbounded Rationality: The Tyranny of the Weak," Post-Print hal-00753239, HAL.
- Abraham Neyman, 1998. "Finitely Repeated Games with Finite Automata," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 513-552, August.
- Kalai, Ehud & Stanford, William, 1988.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
- Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Drew Fudenberg & Eric Maskin, 2008.
"The Folk Theorem In Repeated Games With Discounting Or With Incomplete Information,"
World Scientific Book Chapters, in: Drew Fudenberg & David K Levine (ed.), A Long-Run Collaboration On Long-Run Games, chapter 11, pages 209-230,
World Scientific Publishing Co. Pte. Ltd..
- Fudenberg, Drew & Maskin, Eric, 1986. "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," Econometrica, Econometric Society, vol. 54(3), pages 533-554, May.
- 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.
- Cho, In-Koo, 1996. "Perceptrons Play Repeated Games with Imperfect Monitoring," Games and Economic Behavior, Elsevier, vol. 16(1), pages 22-53, September.
- Devetag, Giovanna & Warglien, Massimo, 2003.
"Games and phone numbers: Do short-term memory bounds affect strategic behavior?,"
Journal of Economic Psychology, Elsevier, vol. 24(2), pages 189-202, April.
- Maria Giovanna Devetag & Massimo Warglien, 2002. "Games and phone numbers: do short term memory bounds affect strategic behavior?," CEEL Working Papers 0211, Cognitive and Experimental Economics Laboratory, Department of Economics, University of Trento, Italia.
- Giovanna Devetag & Massimo Warglien, 2002. "Games and Phone Numbers: Do Short Term Memory Bounds Affect Strategy Behavior?," ROCK Working Papers 018, Department of Computer and Management Sciences, University of Trento, Italy, revised 13 Jun 2008.
- Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Duffy, Sean & Smith, John, 2014.
"Cognitive load in the multi-player prisoner's dilemma game: Are there brains in games?,"
Journal of Behavioral and Experimental Economics (formerly The Journal of Socio-Economics), Elsevier, vol. 51(C), pages 47-56.
- Duffy, Sean & Smith, John, 2012. "Cognitive load in the multi-player prisoner's dilemma game: Are there brains in games?," MPRA Paper 38825, University Library of Munich, Germany.
- Duffy, Sean & Smith, John, 2011.
"Cognitive load in the multi-player prisoner's dilemma game,"
MPRA Paper
30856, University Library of Munich, Germany.
- Duffy, Sean & Smith, John, 2012. "Cognitive load in the multi-player prisoner's dilemma game," MPRA Paper 35906, University Library of Munich, Germany.
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.- Béal, Sylvain, 2007. "Perceptron Versus Automaton∗," Sonderforschungsbereich 504 Publications 07-58, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- 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).
- Kalai, E & Neme, A, 1992.
"The Strength of a Little Perfection,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 335-355.
- Ehud Kalai & Alejandro Neme, 1989. "The Strength of a Little Perfection," Discussion Papers 858, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
- Neme, Alejandro & Quintas, Luis, 1992.
"Equilibrium of repeated games with cost of implementation,"
Journal of Economic Theory, Elsevier, vol. 58(1), pages 105-109, October.
- Alejandro Neme & Luis Quintas, 1988. "Equilibrium of Repeated Games With Cost of Implementation," Discussion Papers 763, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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.
- van Damme, E.E.C., 1995.
"Game theory : The next stage,"
Other publications TiSEM
7779b0f9-bef5-45c7-ae6b-7, Tilburg University, School of Economics and Management.
- van Damme, E.E.C., 1999. "Game theory : The next stage," Other publications TiSEM 9b1f2bbf-2e19-42e7-894a-4, Tilburg University, School of Economics and Management.
- van Damme, E.E.C., 1995. "Game theory : The next stage," Discussion Paper 1995-73, Tilburg University, Center for Economic Research.
- Beal, Sylvain & Querou, Nicolas, 2007.
"Bounded rationality and repeated network formation,"
Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
- Beal, Sylvain & Querou, Nicolas, 2006. "Bounded Rationality and Repeated Network Formation," Coalition Theory Network Working Papers 12169, Fondazione Eni Enrico Mattei (FEEM).
- Nicolas Querou & Sylvain Beal, 2006. "Bounded Rationality and Repeated Network Formation," Working Papers 2006.74, Fondazione Eni Enrico Mattei.
- Sylvain Béal & Nicolas Quérou, 2007. "Bounded rationality and repeated network formation," Post-Print ujm-00162449, HAL.
- 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.
- Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Duffy, Sean & Smith, John, 2014.
"Cognitive load in the multi-player prisoner's dilemma game: Are there brains in games?,"
Journal of Behavioral and Experimental Economics (formerly The Journal of Socio-Economics), Elsevier, vol. 51(C), pages 47-56.
- Duffy, Sean & Smith, John, 2012. "Cognitive load in the multi-player prisoner's dilemma game: Are there brains in games?," MPRA Paper 38825, University Library of Munich, Germany.
- Sylvain Béal, 2006.
"Perceptron versus Automaton,"
Post-Print
hal-00375344, HAL.
- Béal, Sylvain, 2007. "Perceptron versus automaton," Papers 07-58, Sonderforschungsbreich 504.
- Sylvain Béal, 2006. "Perceptron versus Automaton," Post-Print hal-00375356, HAL.
- Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
- Ioannou, Christos A. & Romero, Julian, 2014. "A generalized approach to belief learning in repeated games," Games and Economic Behavior, Elsevier, vol. 87(C), pages 178-203.
- Abraham Neyman, 2008.
"Learning Effectiveness and Memory Size,"
Discussion Paper Series
dp476, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000001945, David K. Levine.
- Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine.
- Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Duffy, Sean & Smith, John, 2011.
"Cognitive load in the multi-player prisoner's dilemma game,"
MPRA Paper
30856, University Library of Munich, Germany.
- Duffy, Sean & Smith, John, 2012. "Cognitive load in the multi-player prisoner's dilemma game," MPRA Paper 35906, University Library of Munich, Germany.
- 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.
- Barlo, Mehmet & Carmona, Guilherme & Sabourian, Hamid, 2009. "Repeated games with one-memory," Journal of Economic Theory, Elsevier, vol. 144(1), pages 312-336, January.
- Olivier Gossner & Penélope Hernández & Ron Peretz, 2016. "The complexity of interacting automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 461-496, March.
More about this item
Keywords
Prisoner’s dilemma; Finitely repeated games; Machine games; Automaton; Perceptron; Bounded complexity; Information processing;All these keywords.
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:kap:theord:v:69:y:2010:i:2:p:183-204. 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.