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.     

Cooperation without Reputation: Experimental Evidence from Prisoner's Dilemma Games

This paper investigates cooperative play in prisoner's dilemma games by designing an experiment to evaluate the ability of two leading theories of observed cooperation: reputation building and altruism. We analyze both one-shot and finitely repeated games to gauge the importance of these theories. We conclude that neither altruism nor reputation building alone can explain our observations. The reputation model is inconsistent with play in both one-shots and finitely repeated games while the model with altruism is unable to explain observed play in the finitely repeated games.Journal of Economic LiteratureClassification Numbers: C72, C92.     

Repeated Games with Almost-Public Monitoring

In repeated games with imperfect public monitoring, players can use public signals to coordinate their behavior, and thus support cooperative outcomes, but with private monitoring, such coordination may no longer be possible. Even though grim trigger is a perfect public equilibrium (PPE) in games with public monitoring, it often fails to be an equilibrium in arbitrarily close games with private monitoring. If a PPE has players' behavior conditioned only on finite histories, then it induces an equilibrium in all close-by games with private monitoring. This implies a folk theorem for repeated games with almost-public almost-perfect monitoring. Journal of Economic Literature Classification Numbers: C72, C73.     

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.     

Reciprocity Game

This paper shows that reciprocity comes from the desire to cooperate in finitely repeated prisoner's dilemma game. Before playing the finitely repeated prisoner's dilemma game, players choose the reciprocity level and commit to it, and the reciprocity level is public information. There are T equilibria if the prisoner's dilemma game is repeated for T periods, and each equilibrium is associated with different levels of cooperation. Further, if players choose their reciprocity levels sequentially, then the most cooperative equilibrium will be the unique equilibrium. However, reciprocity does not matter for the one‐period game and the infinitely repeated game.     

The Nash bargaining solution in general n-person cooperative games

We present a noncooperative foundation for the Nash bargaining solution for an n-person cooperative game in strategic form. The Nash bargaining solution should be immune to any coalitional deviations. Our noncooperative approach yields a new core concept, called the Nash core, for a cooperative game based on a consistency principle. We prove that the Nash bargaining solution can be supported (in every subgame) by a stationary subgame perfect equilibrium of the bargaining game if and only if the Nash bargaining solution belongs to the Nash core.     

Renegotiation-Proof Tariff Agreements

The institutional features of the World Trade Organization motivate the use of renegotiation-proofness as an equilibrium concept in repeated tariff-setting games. This paper shows the existence of a renegotiation-proof equilibrium that reduces tariffs below the noncooperative level. It is found that the one-shot Nash equilibrium cannot be used as a punishment to support such treaties. Punishments are either Pareto-efficient or one country barely accepts them. If the punishing country is hurt by the punishment then punishments will be as short as possible. If the agreement tariff levels are not Pareto-efficient then one country barely goes along with the agreement.     

Self-enforcing collusion in large dynamic markets

The “folk theorem” in game theory implies that any outcome that is better for all players than some single period Nash outcome can be achieved through noncooperative equilibrium in repeated games with discounting. Whether the folk theorem holds for a repeated Cournot oligopoly as the number of firms, N, increases without bound, is investigated. It is shown that the folk theorem holds in the limit iff demand increases at the same rate as the number of firms and the Cournot price sequence is bounded strictly above by the supremum of marginal cost for large N.     

Existence of nontrivial equilibria in repeated games with imperfect private monitoring

We consider finitely repeated games with imperfect private monitoring, and provide several sufficient conditions for such a game to have an equilibrium whose outcome is different from repetition of Nash equilibria of the stage game. Surprisingly, the conditions are consistent with uniqueness of the stage game equilibrium. A class of repeated chicken is shown to satisfy the condition.     

Finitely repeated games with social preferences

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 this result does in general not hold anymore if players have social preferences of the form frequently assumed in the recent literature, for example in the inequity aversion models of Fehr and Schmidt (Quartely Journal of Economics 114:817–868, 1999) or Bolton and Ockenfels (American Economic Review 100:166–193, 2000). In fact, repeating the unique stage game equilibrium may not be a subgame perfect equilibrium at all. This finding should have relevance for all experiments with repeated interaction, whether with fixed, random or perfect stranger matching.     

Moral Hazard and Private Monitoring

We clarify the role of mixed strategies and public randomization (sunspots) in sustaining near-efficient outcomes in repeated games with private monitoring. We study a finitely repeated game, where the stage game has multiple equilibria and show that mixed strategies can support partial cooperation, but cannot approximate full cooperation even if monitoring is “almost perfect.” Efficiency requires extensive form correlation, where strategies can condition upon a sunspot at the end of each period. For any finite number of repetitions, we approximate the best equilibrium payoff under perfect monitoring, assuming that monitoring is sufficiently accurate and sunspots are available. Journal of Economic Literature Classification Numbers: C73, D82.     

Repeated games with one-memory

We study the extent to which equilibrium payoffs of discounted repeated games can be obtained by 1-memory strategies. We establish the following in games with perfect (rich) action spaces: First, when the players are sufficiently patient, the subgame perfect Folk Theorem holds with 1-memory. Second, for arbitrary level of discounting, all strictly enforceable subgame perfect equilibrium payoffs can be approximately supported with 1-memory if the number of players exceeds two. Furthermore, in this case all subgame perfect equilibrium payoffs can be approximately supported by an ε-equilibrium with 1-memory. In two-player games, the same set of results hold if an additional restriction is assumed: Players must have common punishments. Finally, to illustrate the role of our assumptions, we present robust examples of games in which there is a subgame perfect equilibrium payoff profile that cannot be obtained with 1-memory. Thus, our results are the best that can be hoped for.     

The Three-Legged Race: Cooperating to Compete

In the prisoners' dilemma contest several couples play the finitely repeated prisoners' dilemma. Each time a couple cooperates, it scores a point, and a small prize is awarded to the winners. An analogue of the “folk” theorem for repeated games is obtained with subgame perfect equilibrium (SPE). Next, allowing renegotiations within each team, we study a solution concept based on renegotiation-proof equilibrium (RPE). If couples are informed about the score, no equilibrium exists. If they are not, cooperation is the unique equilibrium outcome.Journal of Economic LiteratureClassification Number: C72.     

On Renegotiation-Proof Equilibria in Finitely Repeated Games

This paper studies renegotiation-proof equilibria of Beno?̂t and Krishna (1993) in finitely repeated games with more than two players. We provide a simple characterization of the set of average payoffs from renegotiation-proof equilibria: the limiting set of average equilibrium payoffs is either efficient or dimensionally small as the horizon of the repeated game goes to infinity. Two sufficient conditions for the former to occur are provided. An example shows that those conditions cannot be weakened.Journal of Economic LiteratureClassification Numbers: C72, C73.     

A Folk Theorem for Repeated Sequential Games

We study repeated sequential games where players may not move simultaneously in stage games. We introduce the concept of effective minimax for sequential games and establish a Folk theorem for repeated sequential games. The Folk theorem asserts that any feasible payoff vector where every player receives more than his effective minimax value in a sequential stage game can be supported by a subgame perfect equilibrium in the corresponding repeated sequential game when players are sufficiently patient. The results of this paper generalize those of Wen (1994), and of Fudenberg and Maskin (1986). The model of repeated sequential games and the concept of effective minimax provide an alternative view to the Anti–Folk theorem of Lagunoff and Matsui (1997) for asynchronously repeated pure coordination games.     

The Explanatory Power of Game Theory in International Politics: Syrian–Israeli Crisis Interactions, 1951–87

The present paper assesses the usefulness of game theory in explaining crisis interactions between Israel and Syria. We begin with the simplest game-theoretic tool for analyzing strategic situations: the one-shot 2×2 game. By analyzing the various episodes of the protracted Syrian--Israeli conflict as one-shot 2×2 games, we avoid the multiplicity of equilibria of the infinitely repeated game and the difficulty of specifying an endpoint of a finitely repeated game. The pure strategy Nash equilibria of these one-shot games are treated as theoretical predictions and are compared with the observed outcomes.     

N-PERSON NASH BNARGAINING WITH VARIABEL THREATS*

We consider two models of n-person bargaining problems with the endogenous determination of disagreement points. In the first model, which is a direct extension of Nash's variable threat bargaining model, the disagreement point is determined as an equilibrium threat point. In the second model, the disagreement point is given as a Nash equilibrium of the underlying noncooperative game. These models are formulated as extensive games, and axiomatizations of solutions are given for both models. It is argued that for games with more than two players, the first bargaining model does not preserve some important properties valid for two-person games, e.g., the uniqueness of equilibrium payoff vector. We also show that when the number of players is large, any equilibrium threat point becomes approximately a Nash equilibrium in the underlying noncooperative game, and vice versa. This result suggests that the difference between the two models becomes less significant when the number of players is large.     

On the size and structure of group cooperation

When time preferences are heterogeneous and bounded away from one, how “much” cooperation can be achieved by an ongoing group? How does group cooperation vary with the group's size and structure? This paper examines characteristics of cooperative behavior in the class of symmetric, repeated games of collective action. These are games characterized by “free rider problems” in the level of cooperation achieved. The Repeated Prisoner's Dilemma games is a special case.We characterize the level of maximal average cooperation (MAC), the highest average level of cooperation, over all stationary subgame perfect equilibrium paths, that the group can achieve. The MAC is shown to be increasing in monotone shifts, and decreasing in mean preserving spreads of the distribution of discount factors. The latter suggests that more heterogeneous groups are less cooperative on average. Finally, in a class of Prisoner's Dilemma games, we show under weak conditions that the MAC exhibits increasing returns to scale in a range of heterogeneous discount factors. That is, larger groups are more cooperative, on average, than smaller ones. By contrast, when the group has a common discount factor, the MAC is invariant to group size.     

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.     

Uniqueness of equilibrium for smooth multistage concave games

Smooth, noncooperative, multistage, concave games are formulated so that a new uniqueness condition—based on the Poincaré-Hopf theorem—can be applied. The new condition is the weakest to appear in the uniqueness literature. The uniqueness subgame perfect equilibrium is obtained and examples are given.