Citation:
Abraham Neyman. 1999. “Cooperation In Repeated Games When The Number Of Stages Is Not Commonly Known”. Econometrica, 67, Pp. 45–64.
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