Cooperation and Effective Computability

Luca Anderlini and Hamid Sabourian

Econometrica, 1995, vol. 63, issue 6, pages 1337-69

Abstract: A 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.

Date: 1995
View citations in EconPapers

Downloads: (external link)
http://links.jstor.org/sici?sici=0012-9682%2819951 ... O%3B2-8&origin=repec full text (application/pdf)
Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.

Related works:
Working Paper: Cooperation and Effective Computability (1991)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:ecm:emetrp:v:63:y:1995:i:6:p:1337-69

Ordering information: This journal article can be ordered from
http://www.blackwell ... mb.asp?ref=0012-9682

Access Statistics for this article

Econometrica is edited by Stephen Morris

More articles in Econometrica from Econometric Society
Contact information at EDIRC.
Series data maintained by Christopher F. Baum ().