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

In a repeated game with imperfect public information, the set of equilibria depends on the way that the distribution of public signals varies with the players' actions. Recent research has focused on the case of "frequent monitoring," where the time interval between periods becomes small. Here...

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

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

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

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

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of...

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

Delayed perfect monitoring in an in�nitely repeated discounted game is studied. A player perfectly observes any other player's action choice with a fixed, but finite delay. The observational delays between different pairs of players are heterogeneous and asymmetric. The Folk Theorem extends to...

This paper studies finitely repeated games with semi-standard monitoring played in pure strategies. In these games, each player's action set is endowed with a partition, and the equivalence classes of the actions played are publicly observed. We characterize the limit set of equilibrium payoffs...