COOPERATION AND EFFECTIVE COMPUTABILITY

A common interest game is a game in which there exists a unique pair o f payoffs which strictly Pareto-dominates all other payoffs. We consid er the undiscounted repeated game obtained by the infinite repetition of such a two-player stage game. We show that if supergame strategies are restricted to be computable within Church's thesis, the only pair of payoffs which survives any computable tremble with sufficiently lar ge support is the Pareto-efficient pair. The result is driven by the a bility of the players to use the early stages of the game to communica te their intention to play cooperatively in the future.