A (pure) strategy in a repeated game is a mapping from histories, or, more generally, signals, to actions. We view the implementation of such a strategy as a computational procedure and attempt to capture in a formal model the following intuition: as the game proceeds, the amount of information...

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...

Any correlated equilibrium of a strategic game with bounded payoffs and convex strategy sets which has a smooth concave potential, is a mixture of pure strategy profiles which maximize the potential. If moreover, the strategy sets are compact and the potential is strictly concave, then the game...