Perceptron versus automaton in the finitely repeated prisoner’s dilemma
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Theory and Decision.
Volume (Year): 69 (2010)
Issue (Month): 2 (August)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100341
Prisoner’s dilemma; Finitely repeated games; Machine games; Automaton; Perceptron; Bounded complexity; Information processing;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Cho, In-Koo, 1996. "On the Complexity of Repeated Principal Agent Games," Economic Theory, Springer, vol. 7(1), pages 1-17, January.
- 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.
- 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.
- 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.
- 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.
- Jim Engle-Warnick & Robert Slonim, 2006.
"Inferring repeated-game strategies from actions: evidence from trust game experiments,"
Springer, vol. 28(3), pages 603-632, 08.
- 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.
- Ehud Kalai & William Stanford, 1986.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer, 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.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- 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.
- 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-84, June.
- Rubenstein, A., 1991. "On Price Recognition and Computational Complexity in a Monopolistic Model," Papers 35-91, Tel Aviv.
- 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-54, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.