This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Citations for "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma"

by Neyman, Abraham

For a complete description of this item, click here.
Cited by (explanations, 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.):
  1. Berninghaus, Siegfried K. & Haller, Hans & Outkin, Alexander, 2005. "Neural Networks and Contagion," Sonderforschungsbereich 504 Publications 05-35, Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim.
  2. Damme, E. van, 1995. "Game Theory : The Next Stage," Discussion Paper 73, Tilburg University, Center for Economic Research. [Downloadable!]
  3. Ehud Lehrer & Eilon Solan, 2003. "Excludability and Bounded Computational Capacity Strategies," Discussion Papers 1374, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  4. O. Gossner, 2000. "Sharing a long secret in a few public words," THEMA Working Papers 2000-15, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise. [Downloadable!]
  5. Philippe Jeniel, 2001. "Analogy-Based Expectation Equilibrium," Economics Working Papers 0003, Institute for Advanced Study, School of Social Science. [Downloadable!]
    Other versions:
  6. Amparo Urbano & Penélope Hernández, 2007. "Codification Schemes And Finite Automata," Working Papers. Serie AD 2006-28, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie). [Downloadable!]
  7. Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine. [Downloadable!]
    Other versions:
  8. Justin Smith, 1999. "Strategic Cost and ‘Matching Pennies’," Working Papers 99-07-048, Santa Fe Institute.
  9. Abraham Neyman Null & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy and Nonstationary Bounded Recall," Departmental Working Papers 200514, Rutgers University, Department of Economics. [Downloadable!]
  10. Chaim Fershtman, 1987. "Cooperation Through Delegation," Discussion Papers 731, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  11. Amit Pazgal, 1995. "Satisficing Leads to Cooperation in Mutual Interests Games," Discussion Papers 1126, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  12. 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. [Downloadable!]
    Other versions:
  13. O. Gossner, 1999. "Repeated games played by cryptographically sophisticated players," THEMA Working Papers 99-07, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise. [Downloadable!]
    Other versions:
  14. Barlo, Mehmet & Carmona, Guilherme, 2004. "Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners Dilemma," FEUNL Working Paper Series wp449, Universidade Nova de Lisboa, Faculdade de Economia. [Downloadable!]
    Other versions:
  15. Matsushima, Hitoshi, 1997. "Bounded Rationality in Economics: A Game Theorist's View," CIRJE F-Series 97-F-10, CIRJE, Faculty of Economics, University of Tokyo. [Downloadable!]
  16. Ehud Lehrer & Eilon Solan, 2003. "No-Regret with Bounded Computational Capacity," Discussion Papers 1373, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  17. 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. [Downloadable!]
    Other versions:
  18. Schotter, Andrew, 1991. "Oskar Morgenstern's Contribution to the Development of the Theory of Games," Working Papers 91-08, C.V. Starr Center for Applied Economics, New York University. [Downloadable!]
  19. Nicola Dimitri, 2000. "Correlation, Learning and the Robustness of Cooperation," Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 3(2), pages 311-329, April. [Downloadable!] (restricted)
  20. 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. [Downloadable!]
  21. Abraham Neyman & Daijiro Okada, 2005. "Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall," Discussion Paper Series dp411, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
    Other versions:
  22. Sela, Aner & Dorothea K. Herreiner, . "Fictitious Play in Coordination Games," Discussion Paper Serie B 423, University of Bonn, Germany, revised Dec 1997. [Downloadable!]
    Other versions:
  23. Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
  24. Michele Piccione & Ariel Rubinstein, 2003. "Modeling the Economic Interaction of Agents with Diverse Abilities to Recognize Equilibrium Patterns," Levine's Bibliography 506439000000000108, UCLA Department of Economics. [Downloadable!]
    Other versions:
  25. Béal, Sylvain, 2007. "Perceptron Versus Automaton∗," Sonderforschungsbereich 504 Publications 07-58, Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim. [Downloadable!]
  26. Ran Spiegler, 2001. "Testing Threats in Repeated Games," Economics Working Papers 0009, Institute for Advanced Study, School of Social Science. [Downloadable!]
  27. Eitan Zemel, 1985. "On Communication, Bounded Complexity, and Cooperation," Discussion Papers 685, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  28. Hitoshi Matsushima, 2000. "The Folk Theorem with Private Monitoring and Uniform Sustainability," CIRJE F-Series CIRJE-F-84, CIRJE, Faculty of Economics, University of Tokyo. [Downloadable!]
  29. 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. [Downloadable!]
  30. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  31. Itzhak Gilboa & David Schmeidler, 1989. "Infinite Histories and Steady Orbits in Repeated Games," Discussion Papers 846, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
    Other versions:
  32. Ehud Kalai & John O. Ledyard, 1997. "Repeated Implementation," Discussion Papers 1205, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
    Other versions:
  33. Amparo Urbano & Penélope Hernández, 2001. "Communication And Automata," Working Papers. Serie AD 2001-04, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie). [Downloadable!]
  34. Joseph Y. Halpern, 2004. "A Computer Scientist Looks at Game Theory," Game Theory and Information 0411002, EconWPA. [Downloadable!]
    Other versions:
  35. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  36. Kenneth R. Mount & Stanley Reiter, 1994. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Discussion Papers 1085, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
    Other versions:
  37. Eli Ben-Sasson & Adam Tauman Kalai & Ehud Kalai, 2006. "An Approach to Bounded Rationality," Discussion Papers 1439, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]

Did you know? Authors can create their own profile with links to their works on the RePEc Author Service.

This page was last updated on 2009-12-12.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.