In repeated normal-form games, simple penal codes (Abreu 1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. We provide two examples illustrating that a subgame-perfect outcome...

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public...

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

We consider repeated games with private monitoring that are .close. to repeated games with public/perfect monitoring. A private monitoring information structure is close to a public monitoring information structure when private signals can generate approximately the same distribution of the...

We study stochastic games with an infinite horizon and sequential moves played by an arbitrary number of players. We assume that social memory is finite---every player, except possibly one, is finitely lived and cannot observe events that are sufficiently far back in the past. This class of...

This paper proposes and studies a tractable subset of Nash equilibria, belief-free review-strategy equilibria, in repeated games with private monitoring. The payoff set of this class of equilibria is characterized in the limit as the discount factor converges to one for games where players...

We prove the perfect-monitoring folk theorem continues to hold when attention is restricted to strategies with bounded recall and the equilibrium is essentially required to be strict. As a consequence, the perfect monitoring folk theorem is shown to be behaviorally robust under almost-perfect...

This paper studies the inference of interaction effects, i.e., the impacts of players' actions on each other's payoffs, in discrete simultaneous games with incomplete information. We propose an easily implementable test for the signs of state-dependent interaction effects that does not require...

This paper studies the inference of interaction effects, i.e., the impacts of players' actions on each other's payoffs, in discrete simultaneous games with incomplete information. We propose an easily implementable test for the signs of state-dependent interaction effects that does not require...

This note characterizes the set A¡∞ of actions of player ¡ that are uniquely rationalizable for some hierarchy of beliefs on an arbitrary space of uncertainty. It is proved that for any rationalizable action a¡ for the type t¡, if a¡ belongs to A¡∞ and is justified by conjectures...