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 InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Cambridge - Risk, Information & Quantity Signals in its series Papers with number 167.
Length: 39 pages
Date of creation: 1991
Date of revision:
Contact details of provider:
Postal: UNIVERSITY OF CAMBRIDGE, RESEARCH PROJECT ON RISK, INFORMATION AND QUANTITY SIGNALS IN ECONOMICS(E.S.R.C.), DEPARTMENT OF APPLIED ECONOMICS, SIDGWICK AV. CAMBRIDGE CB3 9DEDE U.K..
Web page: http://www.econ.cam.ac.uk/
More information through EDIRC
game theory ; economic models;
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.
- Fudenberg, Drew & Levine, David, 1995.
"Consistency and Cautious Fictitious Play,"
3198694, Harvard University Department of Economics.
- 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.
- Luca Anderlini (Georgetown University), Dino Gerardi (Yale University), Roger Lagunoff (Georgetown University), 2004.
"The Folk Theorem in Dynastic Repeated Games,"
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.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Game Theory and Information 0410001, EconWPA.
- William R. Zame & John H. Nachbar, 1996.
"Non-computable strategies and discounted repeated games,"
Springer, vol. 8(1), pages 103-122.
- Nachbar, John H & Zame, William R, 1996. "Non-computable Strategies and Discounted Repeated Games," Economic Theory, Springer, vol. 8(1), pages 103-22, June.
- William R. Zame, 1995. "Non-Computable Strategies and Discounted Repeated Games," UCLA Economics Working Papers 735, UCLA Department of Economics.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006.
"Computability of simple games: A characterization and application to the core,"
437, University Library of Munich, Germany.
- 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.
- Roman, Mihai Daniel, 2010. "A game theoretic approach of war with financial influences," MPRA Paper 38389, University Library of Munich, Germany.
- Luca Anderlini, 1995.
"Communication, Computability and Common Interest Games,"
Game Theory and Information
- Anderlini, Luca, 1999. "Communication, Computability, and Common Interest Games," Games and Economic Behavior, Elsevier, vol. 27(1), pages 1-37, April.
- Anderlini, L., 1990. "Communication, Computability And Common Interest Games," Papers 159, Cambridge - Risk, Information & Quantity Signals.
- 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.
- Anderlini, Luca, 1998. "Forecasting errors and bounded rationality: An example," Mathematical Social Sciences, Elsevier, vol. 36(2), pages 71-90, September.
- 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.
- 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.
- 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, 2008. "Entreprises behavior in cooperative and punishment‘s repeated negotiations," MPRA Paper 37527, University Library of Munich, Germany, revised 05 Jan 2009.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
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.