We study repeated games with imperfect public monitoring and unequal discounting. We characterize the limit set of perfect and public equilibrium payoffs as discount factors converge to 1 with the relative patience between players fixed. We show that the pairwise and individual full rank...

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 monitoring is robust to all perturbations of the monitoring structure...

Markov perfection has become the usual solution concept to determine the non-cooperative equilibrium in a dynamic game. However, Markov perfection is a stronger solution concept than subgame perfection: Markov perfection rules out any cooperation in a repeated prisoners' dilemma game because the...

Smith (1995) presented a necessary and sufficient condition for the finite- horizon perfect folk theorem. In the proof of this result, the author constructed a family of five-phase strategy profiles to approach feasible and individually rational payoff vec- tors of the stage-game. These strategy...

Equilibrium payoffs corresponding to subgame perfect equilibria in pure strategies are characterized for infinitely repeated games with discounted payoffs. The equilibrium payoff set of a game is a fixed-point of set-valued operators introduced in the paper. The new operator formalism is...

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 a class of dynamic games, called repeated games with asynchronous moves, where not all players may revise their actions in every period. With state-dependent backwards induction, we introduce the concept of effective minimax in repeated games with asynchronous moves. A...

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

Exploiting small uncertainties on the part of opponents, players in long, finitely repeated games can maintain false reputations that lead to a large variety of equilibrium outcomes. Even cooperation in a finitely repeated prisoners' dilemma is obtainable. Can such false reputations be...

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