Cooperation and Effective Computability
AbstractA common interest game is a game in which there exists a unique pair of payoffs which strictly Pareto dominates all other payoffs. The authors consider the undiscounted repeated game obtained by the infinite repetition of such a two-player stage game. They show that, if supergame strategies are restricted to be computable within Church's thesis, the only pair of payoffs that survives any computable tremble with sufficiently large support is the Pareto-efficient pair. The result is driven by the ability of the players to use the early stages of the game to communicate their intention to play cooperatively in the future. Copyright 1995 by The Econometric Society.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Econometric Society in its journal Econometrica.
Volume (Year): 63 (1995)
Issue (Month): 6 (November)
Other versions of this item:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Nachbar, John H & Zame, William R, 1996.
"Non-computable Strategies and Discounted Repeated Games,"
Springer, vol. 8(1), pages 103-22, June.
- William R. Zame & John H. Nachbar, 1996. "Non-computable strategies and discounted repeated games," Economic Theory, Springer, 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.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004.
"The Folk Theorem in Dynastic Repeated Games,"
Game Theory and Information
- Luca Anderlini (Georgetown University), Dino Gerardi (Yale University), Roger Lagunoff (Georgetown University), 2004. "The Folk Theorem in Dynastic Repeated Games," Working Papers gueconwpa~04-04-09, Georgetown University, Department of Economics.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Levine's Bibliography 122247000000000577, UCLA Department of Economics.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Cowles Foundation Discussion Papers 1490, Cowles Foundation for Research in Economics, Yale University.
- Anderlini, L., 1990.
"Communication, Computability And Common Interest Games,"
159, Cambridge - Risk, Information & Quantity Signals.
- Anderlini, Luca, 1999. "Communication, Computability, and Common Interest Games," Games and Economic Behavior, Elsevier, vol. 27(1), pages 1-37, April.
- Luca Anderlini, 1995. "Communication, Computability and Common Interest Games," Game Theory and Information 9510003, EconWPA.
- Alvaro Sandroni, 1997. "Reciprosity and Cooperation in Repeated Coordination Games: The Blurry Belief Approach," Discussion Papers 1200, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Markose, Sheri M., 2004. "Novelty in complex adaptive systems (CAS) dynamics: a computational theory of actor innovation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 344(1), pages 41-49.
- Fudenberg, Drew & Levine, David K., 1995.
"Consistency and cautious fictitious play,"
Journal of Economic Dynamics and Control,
Elsevier, vol. 19(5-7), pages 1065-1089.
- Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
- Kumabe, Masahiro & Mihara, H. Reiju, 2008.
"Computability of simple games: A characterization and application to the core,"
Journal of Mathematical Economics,
Elsevier, vol. 44(3-4), pages 348-366, February.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A characterization and application to the core," MPRA Paper 437, University Library of Munich, Germany.
- Roman, Mihai Daniel, 2008. "Entreprises behavior in cooperative and punishment‘s repeated negotiations," MPRA Paper 37527, University Library of Munich, Germany, revised 05 Jan 2009.
- Al-Najjar, Nabil I. & Casadesus-Masanell, Ramon & Ozdenoren, Emre, 2003. "Probabilistic representation of complexity," Journal of Economic Theory, Elsevier, vol. 111(1), pages 49-87, July.
- 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.
- Sheri M. Markose, 2004. "Novelty And Surprises In Complex Adaptive System (CAS) Dynamics: A Computational Theory of Actor Innovation," Economics Discussion Papers 575, University of Essex, Department of Economics.
- Roman, Mihai Daniel, 2010. "A game theoretic approach of war with financial influences," MPRA Paper 38389, University Library of Munich, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.