The bounded memory folk theorem

Abstract

We show that the Folk Theorem holds for n-player discounted repeated games with bounded-memory pure strategies. Our result requires each player’s payoff to be strictly above the pure minmax payoff but requires neither time-dependent strategies, nor public randomization, nor communication. The type of strategies we employ to establish our result turn out to have new features that may be important in understanding repeated interactions.