Collusive equilibria in oligopolies with finite lives

It is generally accepted that collusive agreements cannot be sustained in oligopolies with finite lives. In this paper it is shown that, provided the number of competitors is neither too small nor too large, the most restrictive output, i.e., the monopoly output, can be sustained as a perfect Nash equilibrium. If the number of firms is too small only sequences of the Nash equilibria of the constituent market game can appear as perfect Nash equilibria. If the number of firms is too large the power of the cartel falls sharply.     

Evolutionary stability in repeated extensive games played by finite automata

We discuss the emergence of cooperation in repeated Trust Mini-Games played by finite automata. Contrary to a previous result obtained by Piccione and Rubinstein (1993), we first prove that this repeated game admits two Nash equilibria, a cooperative and a non-cooperative one. Second, we show that the cooperative equilibrium is the only (cyclically) stable set under the so-called best response dynamics.     

Renegotiation in repeated games

In repeated games, subgame-perfect equilibria involving threats of punishment may be implausible if punishing one player hurts the other(s). If players can renegotiate after a defection, such a punishment may not be carried out. We explore a solution concept that recognizes this fact, and show that in many games the prospect of renegotiation strictly limits the cooperative outcomes that can be sustained. We characterize those outcomes in general, and in the prisoner's dilemma, Cournot and Bertrand duopolies, and an advertising game in particular.     

Communication in repeated games with costly monitoring

We study repeated games with discounting where perfect monitoring is possible, but costly. It is shown that if players can make public announcements, then every payoff vector which is an interior point in the set of feasible and individually rational payoffs can be implemented in a sequential equilibrium of the repeated game when the discount factor is high enough. Thus, efficiency can be approximated even when the cost of monitoring is high, provided that the discount factor is high enough.     

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.     

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.     

Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives

In a game of a finite number of repetitions of a Cournot-type model of an industry, if firms are satisfied to get close to (but not necessarily achieve) their optimal responses to other firms' sequential strategies, then in the resulting noncooperative “equilibria” of the sequential market game, (1) if the lifetime of the industry is large compared to the number of firms, there are equilibria corresponding to any given duration of the cartel, whereas (2) if the number of firms is large compared to the industry's lifetime, all equilibria will be close (in some sense) to the competitive equilibrium.     

Coordination failure in repeated games with private monitoring

Players coordinate continuation play in repeated games with public monitoring. We investigate the robustness of such equilibrium behavior with respect to ex-ante small private-monitoring perturbations. We show that with full support of public signals, no perfect public equilibrium is robust if it induces a “regular” 2×2$2\times 2$ coordination game in the continuation play. This regularity condition is violated in all belief-free equilibria. Indeed, with an individual full rank condition, every interior belief-free equilibrium is robust. We also analyze block belief-free equilibria and point out that the notion of robustness is sensitive to whether we allow for uninterpretable signals.     

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

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.     

Testing threats in repeated games

Under most game-theoretic solution concepts, equilibrium beliefs are justified by off-equilibrium events. I propose an equilibrium concept for infinitely repeated games, called “Nash Equilibrium with Tests” (NEWT), according to which players can only justify their equilibrium beliefs with events that take place on the equilibrium path itself. In NEWT, players test every threat that rationalizes a future non-myopic action that they take. The tests are an integral part of equilibrium behavior. Characterization of equilibrium outcomes departs from the classical “folk theorems”. The concept provides new insights into the impact of self-enforcement norms, such as reciprocity, on long-run cooperation.     

Communication equilibrium payoffs in repeated games with imperfect monitoring

We characterize the set of communication equilibrium payoffs of any undiscounted repeated matrix-game with imperfect monitoring and complete information. For two-player games, a characterization is provided by Mertens, Sorin, and Zamir (Repeated games, Part A (1994) CORE DP 9420), mainly using Lehrer's (Math. Operations Res. (1992) 175) result for correlated equilibria. The main result of this paper is to extend this characterization to the n-player case. The proof of the characterization relies on an analogy with an auxiliary 2-player repeated game with incomplete information and imperfect monitoring. We use Kohlberg's (Int. J. Game Theory (1975) 7) result to construct explicitly a canonical communication device for each communication equilibrium payoff.     

Perfect communication equilibria in repeated games with imperfect monitoring

This paper introduces an equilibrium concept called perfect communication equilibrium for repeated games with imperfect private monitoring. This concept is a refinement of Myerson's [Myerson, R.B., 1982. Optimal coordination mechanisms in generalized principal agent problems, J. Math. Econ. 10, 67–81] communication equilibrium. A communication equilibrium is perfect if it induces a communication equilibrium of the continuation game, after every history of messages of the mediator. We provide a characterization of the set of corresponding equilibrium payoffs and derive a Folk Theorem for discounted repeated games with imperfect private monitoring.     

Approximate efficiency in repeated games with correlated private signals

This paper presents repeated games with hidden moves, in which players receive imperfect private signals and are able to communicate. We propose a conditional probability approach to solve the learning problem in repeated games with correlated private signals and delayed communication. We then apply this approach to symmetric n-player games to obtain an approximate efficiency result.     

Perfect communication equilibria in repeated games with imperfect monitoring

This paper introduces an equilibrium concept called perfect communication equilibrium for repeated games with imperfect private monitoring. This concept is a refinement of Myerson's [Myerson, R.B., 1982. Optimal coordination mechanisms in generalized principal agent problems, J. Math. Econ. 10, 67–81] communication equilibrium. A communication equilibrium is perfect if it induces a communication equilibrium of the continuation game, after every history of messages of the mediator. We provide a characterization of the set of corresponding equilibrium payoffs and derive a Folk Theorem for discounted repeated games with imperfect private monitoring.     

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.     

Communication in repeated monetary policy games

A central bank and the public are engaged in an infinitely repeated monetary policy game with communication. For reasonable discount factors, there exists an equilibrium in which the central bank fully reveals its private information. The fully revealing equilibrium is superior to the uninformative equilibrium. The welfare gain of transparency increases with the slope of the Phillips curve, the natural rate of unemployment, and the degree of heterogeneity in the population. Transparency results in lower inflation but a higher variability of inflation.     

Monitoring institutions in indefinitely repeated games

Does monitoring past conduct facilitate intertemporal cooperation? We designed an experiment characterized by strategic uncertainty and multiple equilibria where coordinating on the efficient outcome is a challenge. Participants, interacting anonymously in a group, could pay a cost either to obtain information about their counterparts, or to create a freely available public record of individual conduct. Both monitoring institutions were actively employed. However, groups were unable to attain higher levels of cooperation compared to a treatment without monitoring. Information about past conduct alone thus appears to be ineffective in overcoming coordination challenges.     

Adaptation and complexity in repeated games

The paper presents a learning model for two-player infinitely repeated games. In an inference step players construct minimally complex inferences of strategies based on observed play, and in an adaptation step players choose minimally complex best responses to an inference. When players randomly select an inference from a probability distribution with full support the set of steady states is a subset of the set of Nash equilibria in which only stage game Nash equilibria are played. When players make ‘cautious’ inferences the set of steady states is the subset of self-confirming equilibria with Nash outcome paths. When players use different inference rules, the set of steady states can lie between the previous two cases.