We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff...

This paper uses a laboratory experiment to study the effect of a monitoring structure on the play of the infinitely repeated prisoner's dilemma. Keeping the stage game fixed, we examine the behavior of subjects when information about past actions is perfect (perfect monitoring), noisy but public...

This paper uses a laboratory experiment to study the effect of a monitoring structure on the play of the infinitely repeated prisoner's dilemma. Keeping the stage game fixed, we examine the behavior of subjects when information about past actions is perfect (perfect monitoring), noisy but public...

We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The...

In this paper, I analyze stochastic adaptation in finite n-player games played by heterogeneous populations of myopic best repliers, better repliers and imitators. In each period, one individual from each of n populations, one for each player role, is drawn to play and chooses a pure strategy...

We show that in symmetric two-player exact potential games, the simple decision rule "imitate-if-better" cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...

A well-known result from the theory of finitely repeated games states that if the stage game has a unique equilibrium, then there is a unique subgame perfect equilibrium in the finitely repeated game in which the equilibrium of the stage game is being played in every period. Here I show that...

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but...

We show that in symmetric two-player exact potential games, the simple decision rule "imitate-if-better" cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...