Purification in the Infinitely-Repeated Prisoners’ Dilemma

This paper investigates the Harsanyi (1973)-purifiability of mixed strategies in the repeated prisoners’ dilemma with perfect monitoring. We perturb the game so that in each period, a player receives a private payoff shock which is independently and identically distributed across players and periods. We focus on the purifiability of a class of one-period memory mixed strategy equilibria used by Ely and V¨alim¨aki (2002) in their study of the repeated prisoners’ dilemma with private monitoring. We find that the strategy profile is purifiable by perturbed-game finite-memory strategies if and only if it is strongly symmetric, in the sense that after every history, both players play the same mixed action. Thus “most” strategy profiles are not purifiable by finite memory strategies. However, if we allow infinite memory strategies in the perturbed game, then any completely-mixed equilibrium is purifiable.