Under appropriate assumptions (private values and uniform punishments), the Nash equilibria of a Bayesian repeated game without discounting are payoff-equivalent to tractable, completely revealing, equilibria and can be achieved as interim cooperative solutions of the initial Bayesian game. This...

Under appropriate assumptions (private values and uniform punishments), the Nash equilibria of a Bayesian repeated game without discounting are payoff-equivalent to tractable, completely revealing, equilibria and can be achieved as interim cooperative solutions of the initial Bayesian game. This...

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