Cooperation in Repeated Games when the Number of Stages is Not Commonly Known
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.
Year of publication: |
1999
|
---|---|
Authors: | Neyman, Abraham |
Published in: |
Econometrica. - Econometric Society. - Vol. 67.1999, 1, p. 45-64
|
Publisher: |
Econometric Society |
Saved in:
Saved in favorites
Similar items by person
-
Cooperation, repetition, and automata
Neyman, Abraham, (1997)
-
The positive value of information
Neyman, Abraham, (1991)
-
Values of games with infinitely many players
Neyman, Abraham, (2002)
- More ...