Global dynamics in repeated games with additively separable payoffs

This paper studies the global dynamics of a class of infinitely repeated two-player games in which the action space of each player is an interval, and the one-shot payoff of each player is additively separable in actions. We define an immediately reactive equilibrium (IRE) as a pure-strategy subgame perfect equilibrium such that each player's action is a stationary function of the opponent's last action. We completely characterize IREs and their dynamics in terms of certain indifference curves. Our results are used to show that in a prisoners' dilemma game with mixed strategies, gradual cooperation occurs when the players are sufficiently patient, and that in a certain duopoly game, kinked demand curves emerge naturally.     

Interlinkage and Generous Tit‐for‐Tat Strategy

We investigate an infinitely‐repeated prisoners' dilemma with imperfect monitoring and consider the possibility that the interlinkage of the players' distinct activities enhances implicit collusion. We show a necessary and sufficient condition for the existence of a generous tit‐for‐tat Nash equilibrium. Such an equilibrium, if it exists, is unique. This equilibrium achieves approximate efficiency when monitoring is almost perfect, where the discount factors are fixed.     

On the Use of the Prisoners' Dilemma to Analyze the Relations Between Employment Security,Trust, And Effort

Sociologists and political scientists have argued that the explanatory adequacy of economics is undermined by unreasonable assumptions of rationality. Yet interpretations that make strong rationality assumptions remain common. Analyses of the effects of employment security on work effort provide one example. The iterated prisoners' dilemma has been used to deduce a positive effect of employment security on work effort. Several difficulties with this approach are identified, including that the cooperative solution to the iterated prisoners' dilemma game i) requires infinite play or uncertainty about the end of the repetitions of the game; ii) is made less likely where there are structural bases for divergent interests; iii) ignores the possibility that employers might choose to shift the game to another arena. In general, there is the difficulty that employer-employee relations involve three simultaneous prisoners' dilemmas. The paper concludes that the hyper-rational approach implied in the prisoners' dilemma is an unpromising route for the analysis of the effects of employment security.     

A folk theorem for minority games

We study a particular case of repeated games with public signals. In the stage game an odd number of players have to choose simultaneously one of two rooms. The players who choose the less crowded room receive a reward of one euro (whence the name “minority game”). The players in the same room do not recognize each other, and between the stages only the current majority room is publicly announced. We show that in the infinitely repeated game any feasible payoff can be achieved as a uniform equilibrium payoff, and as an almost sure equilibrium payoff. In particular we construct an inefficient equilibrium where, with probability one, all players choose the same room at almost all stages. This equilibrium is sustained by punishment phases which use, in an unusual way, the pure actions that were played before the start of the punishment.     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Communication in repeated network games with imperfect monitoring

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 of his neighbors. Players can communicate costlessly at each stage: communication can be public, private or a mixture of both. Payoffs are assumed to be sensitive to unilateral deviations. First, for any network, a folk theorem holds if some Joint Pairwise Identifiability condition regarding payoff functions is satisfied. Second, a necessary and sufficient condition on the network topology for a folk theorem to hold for all payoff functions is that no two players have the same set of neighbors not counting each other.     

DISCRIMINATION IN A MODEL OF CONTESTS WITH INCOMPLETE INFORMATION ABOUT ABILITY

We study contests with private information and identical contestants, where contestants' efforts and innate abilities generate output of varying qualities. The designer's revenue depends on the quality of the output, and she offers a reward to the contestant achieving the highest quality. We characterize the equilibrium behavior, outcomes, and payoffs for both nondiscriminatory and discriminatory (where the reward is contestant‐dependent) contests. We derive conditions under which the designer obtains a larger payoff when using a discriminatory contest and describe settings, where these conditions are satisfied.     

Learning from private information in noisy repeated games

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games where players observe imperfect public signals of the actions played, and both the payoff functions and the map from actions to signal distributions depend on an unknown state. The PTXE payoffs when players are patient are determined by the solutions to a family of linear programming problems. Using this characterization, we develop conditions under which play can be as if the players have learned the state. We provide a sufficient condition for the folk theorem, and a characterization of the PTXE payoffs in games with a known monitoring structure.     

FINITELY REPEATED PRISONERS' DILEMMA WITH SMALL FINES: THE PENANCE CONTRACT*

This paper investigates finitely repeated prisoners' dilemma games with explicit contractual devices. It shows that full collusion can be achieved in a unique manner by incentivizing the players' final‐period play with small fines. The incentivizing modality is the penance contract, by which a player is penalized if and only if he deviates from the penance strategy in the final period. Using this contractual agreement brings the penance strategy profile into unique subgame perfect equilibrium in the entire game and achieves full collusion without being invalidated by renegotiation.     

The impact of peer ratings on cooperation: The role of information and cost of rating

In this study, we experimentally analyze the effectiveness of payoff‐irrelevant peer‐to‐peer ratings as a cooperation enforcement device in a finitely repeated public goods game setting. We run two treatments that differ in the amount of information on own and others' received rating points provided to the players, whereas, in a third treatment, we analyze peer approval when assigning ratings to others is costly. In particular, we wonder whether, even under anonymity and in the absence of reputational concerns, (a) players rate others' contribution decisions in the expected direction and (b) the peer rating mechanisms under study foster cooperation and welfare. Our findings reveal that, in the two costless rating treatments, peer rating concerns lead to higher contributions and efficiency, compared to our control. Introducing a small fixed cost for assigning rating points results in a very high percentage of subjects deciding not to rate others' behavior, so that cooperation cannot be enforced.     

THE EXPECTED NUMBER OF COOPERATORS IN THE N‐PERSON PRISONERS’ DILEMMA WITH RANDOM ORDER MOVES*

The present paper examines the possibility of cooperation occurring in the N‐person prisoners’ dilemma, played with randomly ordered moves and imperfect information. To take into account imperfect cooperation, the degree of cooperation is evaluated in terms of the expected number of cooperators. It is shown that: (i) the expected number of cooperators is maximized at an equilibrium, a combination of strategies each of which is a type of trigger strategy; (ii) the maximum expected number of cooperators is attained in a state of imperfect cooperation for a range of payoff functions; and (iii) the maximum expected number of cooperators is non‐decreasing when the size of players’ group increases.     

Equilibrium play and adaptive learning in a three-person centipede game

The two-person centipede game is one of the most celebrated paradoxes of backward induction in complete information extensive form games. An experimental investigation of a three-person centipede game shows that the paradoxical results are strongly affected by the size of the stakes. When the number of players in the game is increased from two to three and the game is played for unusually high stakes with group composition being randomly changed from trial to trial, the paradox is considerably weakened as players approach equilibrium play with multiple iterations of the stage game. When the game is played with low stakes, there is no evidence for equilibrium play or learning across iterations of the stage game. An adaptive learning model that assumes updating of the individual probabilities of choice outperforms alternative static and dynamic models in accounting for the major results observed in the high-stake experiment.     

A Risk‐Dominant Allocation: Maximizing Coalition Stability

This paper presents a rule to allocate a coalition’s worth for superadditive games with positive externalities. The allocation rule awards each member their outside payoff, plus an equal share of the surplus. The resulting allocation maximizes coalition stability. Stable coalitions are Strong Nash equilibria since no subset of members has an incentive to leave. Similarly, no subset of non‐members has an incentive to join a stable coalition if the game is concave in this region. The allocation is risk‐dominant. All stable coalitions are robust to the maximum probability of 50% that players’ deviate from their individual best‐responses. The paper compares the allocation to the Shapley value and the Nash bargaining solution, and illustrates why these traditional rules result in small coalitions when applied to issues such as international environmental agreements.     

Learning aspiration in repeated games

We study infinitely repeated symmetric 2×2 games played by bounded rational agents who follow a simple rule of thumb: each agent continues to play the same action if the current payoff exceeds the average of the past payoffs, and switches to the other action with a positive probability otherwise. By applying the stochastic approximation technique, we characterize the asymptotic outcomes for all 2×2 games. In the prisoners’ dilemma game, for example, the players cooperate in the limit if and only if the gain from defecting against cooperation is “modest.”     

A “Super” Folk Theorem for dynastic repeated games

We analyze dynastic repeated games. These are repeated games in which the stage game is played by successive generations of finitely-lived players with dynastic preferences. Each individual has preferences that replicate those of the infinitely-lived players of a standard discounted infinitely-repeated game. Individuals live one period and do not observe the history of play that takes place before their birth, but instead create social memory through private messages received from their immediate predecessors. Under mild conditions, when players are sufficiently patient, all feasible payoff vectors (including those below the minmax of the stage game) can be sustained by sequential equilibria of the dynastic repeated game with private communication. In particular, the result applies to any stage game with n  ≥  4 players for which the standard Folk Theorem yields a payoff set with a non-empty interior. We are also able to characterize fully the conditions under which a sequential equilibrium of the dynastic repeated game can yield a payoff vector not sustainable as a subgame perfect equilibrium of the standard repeated game. For this to be the case it must be that the players’ equilibrium beliefs violate a condition that we term “inter-generational agreement.” A previous version of this paper was circulated as Anderlini et al. (2005). We are grateful to Jeff Ely, Leonardo Felli, Navin Kartik, David Levine, Stephen Morris, Michele Piccione, Andrew Postlewaite, Lones Smith and to seminar audiences at Bocconi, Cambridge, CEPR-Guerzensee, Chicago, Columbia, Edinburgh, Essex, Georgetown, Leicester, LSE, Northwestern, Oxford, Rome (La Sapienza), Rutgers, SAET-Vigo, Stanford, SUNY-Albany, UCL, UC-San Diego, Venice and Yale for helpful feedback.     

AN EXPERIMENT WITH ULTIMATUM BARGAINING IN A CHANGING ENVIRONMENT*

We present experimental results on the ultimatum bargaining game which support an evolutionary explanation of subjects’ behaviour in the game. In these experiments subjects interacted with each other and also with virtual players, i.e. computer programs with pre‐specified strategies. Some of these virtual players were designed to play the equitable allocation, while others exhibited behaviour closer to the subgame‐perfect equilibrium, in which the proposer's share is much larger than that of the responder. We have observed significant differences in the behaviour of real subjects depending on the type of “mutants” (virtual players) that were present in their environment.     

Belief-Based Equilibria in the Repeated Prisoners' Dilemma with Private Monitoring

We analyze repeated prisoners' dilemma games with imperfect private monitoring and construct mixed trigger strategy equilibria. Such strategies have a simple representation, where a player's action only depends upon her belief that her opponent(s) are continuing to cooperate. When monitoring is almost perfect, the symmetric efficient outcome can be approximated in any prisoners' dilemma game, while every individually rational feasible payoff can be approximated in a class of such games. The efficiency result extends when there are more than two players. It requires that monitoring be sufficiently accurate but does not require very low discounting when a public randomization device is available. Journal of Economic Literature Classification Numbers: C73, D82.     

A folk theorem for repeated games played on a network

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 each stage, a player is only informed of his payoff and of the messages he received from his neighbors. Payoffs are assumed to be sensitive to unilateral deviations. The main result is to establish a necessary and sufficient condition on the network for a Nash folk theorem to hold, for any such payoff function.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.