Citation:
Neyman A. Cooperation in Repeated Games when the Number of Stages is not Commonly Known. Econometrica. 1999;67 :45--64.
Paper | 1.81 MB |
Abstract:
It is shown that 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 ap
See also: Repeated games