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.     

Hierarchical thinking and learning in rank order contests

We analyze a class of coordination games in which the Kth player to submit an entry wins a contest. These games have an infinite number of symmetric equilibria and the set of equilibria does not change with K. We run experiments with 15 participants and with K=3, 7, and 11. Our experiments show that the value of K affects initial submissions and convergence to equilibrium. When K is small relative to the number of participants, our experiments show that repeated play converges to or near zero. When K is large, an equilibrium is often not reached as a result of repeated play. We seek explanations to these patterns in hierarchical thinking and direction learning.      

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.     

Monotone Games with Positive Spillovers

A monotone game comprises the infinitely repeated play of an n-person stage game, subject to the constraint that players' actions be monotonically nondecreasing over time. These games represent a variety of strategic situations in which players are able to make (partial) commitments. If the stage games have positive spillovers and satisfy certain other conditions, then the limit points of the subgame perfect equilibria are precisely the approachable action profiles. This characterization is applied to voluntary contribution games, market games, and coordination games. Journal of Economic Literature Classification Number: C7.     

Non-Additive Beliefs and Strategic Equilibria

This paper studies n-player games where players' beliefs about their opponents' behaviour are modelled as non-additive probabilities. The concept of an “equilibrium under uncertainty” which is introduced in this paper extends the equilibrium notion of Dow and Werlang (1994, J. Econom. Theory64, 305–324) to n-player games in strategic form. Existence of such an equilibrium is demonstrated under usual conditions. For low degrees of ambiguity, equilibria under uncertainty approximate Nash equilibria. At the other extreme, with a low degree of confidence, maximin equilibria appear. Finally, robustness against a lack of confidence may be viewed as a refinement for Nash equilibria. Journal of Economic Literature Classification Numbers: C72, D81.     

On the (non-)lattice structure of the equilibrium set in games with strategic substitutes

This paper studies models where the optimal response functions under consideration are not increasing in endogenous variables, and weakly increasing in exogenous parameters. Such models include games with strategic substitutes, and include cases where additionally, some variables may be strategic complements. The main result here is that the equilibrium set in such models is a non-empty, complete lattice, if, and only if, there is a unique equilibrium. Indeed, for a given parameter value, a pair of distinct equilibria are never comparable. Therefore, with multiple equilibria, some of the established techniques for exhibiting increasing equilibria or computing equilibria that use the largest or smallest equilibrium, or that use the lattice structure of the equilibrium set do not apply to such models. Moreover, there are no ranked equilibria in such models. Additionally, the analysis here implies a new proof and a slight generalization of some existing results. It is shown that when a parameter increases, no new equilibrium is smaller than any old equilibrium. (In particular, in n-player games of strategic substitutes with real-valued action spaces, symmetric equilibria increase with the parameter.)      

Belief-Based Refinements in Signalling Games

There are many economic problems which, when modelled as games of incomplete information, give rise to many sequential equilibria, severely limiting the usefulness of the model. There has recently been a large literature devoted to "refining" the set of equilibria in order to reduce this multiplicity by restricting the set of admissible disequilibrium beliefs. This paper argues that the logical foundations of some refinements and the equilibria they focus on are problematic and, further, proposes an alternative refinement that avoids the difficulties. We also provide an existence theorem covering a broad class of signalling games often studied in economics. Journal of Economic Literature Classification Numbers: C72, C70, D82.     

An Evolutionary Interpretation of Mixed-Strategy Equilibria

A convincing interpretation of mixed-strategy equilibria describes them as steady states in a large population in which players use pure strategies but the population as a whole mimics a mixed strategy. I study the conditions under which an evolutionary, stochastic learning process converges to the appropriate distribution over pure strategies in the population. I find that not all mixed equilibria can be justified as the result of an evolutionary process even if the equilibrium is unique. For symmetric 2 × 2 and 3 × 3 games I give necessary and sufficient conditions for convergence, which are related to the concept of an ESS, and forn × ngames I give a sufficient condition.Journal of Economic LiteratureClassification Numbers: C73, D83.     

Evolutionary Stability of Pure-Strategy Equilibria in Finite Games

Sufficient conditions for pure-strategy Nash equilibria of finite games to be (Lyapunov) stable under a large class of evolutionary dynamics, the regular monotonic selection dynamics, are discussed. In particular, it is shown that in almost all finite extensive-form games, all the pure-strategy equilibria are stable. In such games, all mixed-strategy equilibria close to pure-strategy equilibria are also stable.Journal of Economic LiteratureClassification Numbers: C70, C72.     

How to Select a Dual Nash Equilibrium

The paper analyzes situations, generalizing the duopoly problem, where two identical players are allowed with two control variables each, all of them linked through two non-strategic private constraints. Four dual equilibria are then obtained when each agent selects one leading variable to optimize and adjusts the other, and these equilibria are compared in a meta-game. For a simplified class of continuous games with linear constraints, it is shown that one symmetric dual equilibrium dominates the others and is the only perfect equilibrium of the metagame. The latter result holds locally for all quasi-concave utility functions and globally for all homogeneous ones, always keeping linear constraints. However, it is no longer valid in discrete games where the implicit constraints are not linear. Journal of Economic Literature Classification Numbers: C72, D43.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.     

Evolution of Interdependent Preferences in Aggregative Games

We study the evolution of preference interdependence in aggregative games which are symmetric with respect to material payoffs but asymmetric with respect to player objective functions. We identify a class of aggregative games whose equilibria have the property that the players with interdependent preferences (who care not only about their own material payoffs but also about their payoffs relative to others) earn strictly higher material payoffs than do the material payoff maximizers. Implications of this finding for the theory of preference evolution are discussed. Journal of Economic Literature Classification Numbers: C72, D62.     

Evolution and Mixed Strategies

Selten (1980, J. Theoret. Biol., 84, 93–101) showed that no mixed equilibria are evolutionarily stable when players can condition their strategies on their roles in a game. Alternatively, Harsanyi's (1973, Int. J. Game Theory, 2, 1–23) purification argument implies that all mixed equilibria are approximations of strict, and hence evolutionarily stable, equilibria of games with slightly perturbed payoffs. This paper reconciles these results: Approximations of mixed equilibria have high invasion barriers, and hence are likely to persist, when payoff perturbations are relatively important and role identification is relatively noisy. When payoff perturbations are unimportant and role identification is precise, approximations of mixed equilibria will have small invasion barriers and are unlikely to persist. Journal of Economic Literature Classification Numbers: C70, C78.     

Meaning and Credibility in Cheap-Talk Games

I define neologism-proofness, a refinement of perfect Bayesian equilibrium in cheap-talk games. It applies when players have a preexisting common language, so that an unexpected message′s literal meaning is clear, and only credibility restricts communication. I show that certain implausible equilibria are not neologism-proof; in some games, no equilibrium is. Journal of Economic Literature classification numbers: D83 D82 C73.     

Bounding the inefficiency of equilibria in nonatomic congestion games

Equilibria in noncooperative games are typically inefficient, as illustrated by the Prisoner's Dilemma. In this paper, we quantify this inefficiency by comparing the payoffs of equilibria to the payoffs of a “best possible” outcome. We study a nonatomic version of the congestion games defined by Rosenthal [Int. J. Game Theory 2 (1973) 65], and identify games in which equilibria are approximately optimal in the sense that no other outcome achieves a significantly larger total payoff to the players—games in which optimization by individuals approximately optimizes the social good, in spite of the lack of coordination between players. Our results extend previous work on traffic routing games.     

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.     

Evolutionary stability and lexicographic preferences

We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. Econ. Theory 57, 278–305) are limit Nash equilibria. Modified evolutionary stability differs from “lexicographic evolutionarily stability” (defined by extending the common characterization of evolutionary stability to lexicographic preferences) in the order in which limits in the payoff space and the space of invasion barriers are taken.     

Brown–von Neumann–Nash dynamics: The continuous strategy case

Brown and von Neumann introduced a dynamical system that converges to saddle points of zero sum games with finitely many strategies. Nash used the mapping underlying these dynamics to prove existence of equilibria in general games. The resulting Brown–von Neumann–Nash dynamics are a benchmark example for myopic adjustment dynamics that, in contrast to replicator dynamics, allow for innovation, but require less rationality than the best response dynamics. This paper studies the BNN dynamics for games with infinitely many strategies. We establish Nash stationarity for continuous payoff functions. For negative semidefinite games (that include zero sum games), we generalize the results of Brown and von Neumann. In addition, we show that evolutionarily robust Nash equilibria are asymptotically stable. A complete stability analysis for doubly symmetric games is also obtained.     

Finite Horizon Bargaining and the Consistent Field

We explore the relationships between noncooperative bargaining games and the consistent value for nontransferable utility (NTU) cooperative games. A dynamic approach to the consistent value is introduced: the consistent vector field. The main contribution is to establish that theconsistent fieldis intimately related to the concept ofsubgame perfectionfor finite horizon noncooperative bargaining games, as the horizon goes to infinity and the cost of delay goes to zero. We then show that in the general NTU case—unlike the transferable utility and pure bargaining cases—the finite horizon subgame perfect equilibria need not approach the consistent value.Journal of Economic LiteratureClassification Numbers: C71, C72.     

On ‘Informationally Robust Equilibria’ for Bimatrix Games

Informationally robust equilibria (IRE) are introduced in Robson (Games Econ Behav 7: 233–245, 1994) as a refinement of Nash equilibria for strategic games. Such equilibria are limits of a sequence of (subgame perfect) Nash equilibria in perturbed games where with small probability information about the strategic behavior is revealed to other players (information leakage). Focusing on bimatrix games, we consider a type of informationally robust equilibria and derive a number of properties they form a non-empty and closed subset of the Nash equilibria. Moreover, IRE is a strict concept in the sense that the IRE are independent of the exact sequence of probabilities with which information is leaked. The set of IRE, like the set of Nash equilibria, is the finite union of polytopes. In potential games, there is an IRE in pure strategies. In zero-sum games, the set of IRE has a product structure and its elements can be computed efficiently by using linear programming. We also discuss extensions to games with infinite strategy spaces and more than two players. The authors would like to thank Marieke Quant for her helpful comments.