Cooperation in Repeated Games when the Number of Stages is Not Commonly Known

Abraham Neyman ()

Econometrica, 1999, vol. 67, issue 1, 45-64

Abstract: An exponentially small departure from the common knowledge assumption on the number T of repetitions of the prisoners' dilemma already enables cooperation. More generally, with such a departure, any feasible individually rational outcome of any one-shot game can be approximated by an equilibrium of a finitely repeated version of that game. The departure from common knowledge is small in the following sense:(1) the players know T with precision +/-K; (2) with probability 1 - epsilon, the players know T precisely; moreover, this knowledge is mutual of order epsilon T; and (3) the deviation of T from its finite expectation is exponentially small.

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (28)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
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: https://EconPapers.repec.org/RePEc:ecm:emetrp:v:67:y:1999:i:1:p:45-64

Ordering information: This journal article can be ordered from
https://www.economet ... ordering-back-issues

Access Statistics for this article

Econometrica is currently edited by Guido Imbens

More articles in Econometrica from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().