We show that small switching costs can have surprisingly dramatic effects in infinitely repeated games if these costs are large relative to payoffs in a single period. This shows that the results in Lipman and Wang [2000] do have analogs in the case of infinitely repeated games. We also discuss...

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

This paper studies infinite-horizon stochastic games in which players observe payoffs and noisy public information about a hidden state each period. We find that, very generally, the feasible and individually rational payoff set is invariant to the initial prior about the state in the limit as...

Linking of repeated games and exchange of concessions in fields of relative strength may lead to more cooperation and to Pareto improvements relative to the situation where each game is played separately. In this paper we formalize these statements, provide some general results concerning the...

We study strategies with one–period recall in the context of a general class of multilateral bargaining games. A strategy has one–period recall if actions in a particular period are only conditioned on information in the previous and the current period. We show that if players are...

This paper analyses the role of transfer payments and strategic con tracting within two-person strategic form games with monetary pay-offs. First, it introduces the notion of transfer equilibrium as a strategy combination for which individual stability can be supported by allowing the...

We study how group size affects cooperation in an infinitely repeated n-player Prisoner`s Dilemma (PD) game. In each repetition of the game, groups of size n ≤ M are randomly and anonymously matched from a fixed population of size M to play the n-player PD stage game. We provide conditions...

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

I consider repeated games with private monitoring played on a network. Each player has a set of neighbors with whom he interacts: a player's payoff depends on his own and his neighbors' actions only. Monitoring is private and imperfect: each player observes his stage payoff but not the actions...