The communication revelation principle (RP) of mechanism design states that any outcome that can be implemented using any communication system can also be implemented by an incentive-compatible direct mechanism. In multistage games, we show that in general the communication RP fails for the solution concept of sequential equilibrium (SE). However, it holds in important classes of games, including single-agent games, games with pure adverse selection, games with pure moral hazard, and a class of social learning games. For general multistage games, we establish that an outcome is implementable in SE if and only if it is implementable in a canonical Nash equilibrium in which players never take codominated actions. We also prove that the communication RP holds for the more permissive solution concept of conditional probability perfect Bayesian equilibrium.

We study the repeated prisoner’s dilemma with random matching, a canonical model of community enforcement with decentralized information. We assume that (1) with small probability, each player is a “bad type” who never cooperates, (2) players observe and remember their partners’ identities, and (3) each player interacts with others frequently but meets any particular partner infrequently. We show that these assumptions preclude cooperation in the absence of explicit communication but that introducing within-match cheap talk communication restores cooperation. Thus, communication is essential for community enforcement.

We introduce a new model of repeated games in large populations with random matching, overlapping generations, and limited records of past play. We prove that steady-state equilibria exist under general conditions on records. When the updating of a player’s record can depend on the actions of both players in a match, any strictly individually rational action can be supported in a steady-state equilibrium. When record updates can depend only on a player’s own actions, fewer actions can be supported. Here, we focus on the prisoner’s dilemma and restrict attention to strict equilibria that are coordination-proof, meaning that matched partners never play a Pareto-dominated Nash equilibrium in the one-shot game induced by their records and expected continuation payoffs. Such equilibria can support full cooperation if the stage game is either “strictly supermodular and mild” or “strongly supermodular,” and otherwise permit no cooperation at all. The presence of “supercooperator” records, where a player cooperates against any opponent, is crucial for supporting any cooperation when the stage game is “severe.”