Cooperation and computability in \(n\)-player games (Q5946255)

The paper investigates the undiscounted repetition of an \(n\)-player common interest game. It is a game that has a unique Pareto-optimal vector of payoffs strictly dominating all other payoffs. The interest is focused to the strategies of such supergames which are computable within Church's thesis, and computable trembles on the strategies are introduced. The main result shows that if the trembles have sufficiently large support then the only equilibrium vector of payoffs that survives after many repetitions of the game is the Pareto-efficient one. This result is proved by backwards induction on the set of players. It is also shown that the main result fails in the case of a countable infinity of players.