Equilibrium selection in coordination games with simultaneous play

Summary. We apply the dynamic stochastic framework proposed in recent evolutionary literature to a class of coordination games played simultaneously by the entire population. In these games payoffs, and hence best replies, are determined by a summary statistic of the population strategy profile. We demonstrate that with simultaneous play, the equilibrium selection depends crucially on how best responses to the summary statistic remain piece-wise constant. In fact, all the strict Nash equilibria in the underlying stage game can be made stochastically stable depending on how the best response mapping generates piece-wise constant best responses. Received: February 12, 2001; revised version: October 29, 2001     

Stability and equilibrium selection in a link formation game

In this paper we study a static link formation game under consent that has multiple Nash equilibria. In the literature, the use of coalitional refinements has been the standard approach to select among equilibria. Alternatively, based on the Global Games theory, a non cooperative equilibrium selection approach is proposed, so as to select those Nash equilibria that are robust to the introduction of incomplete information. Interestingly, the equilibrium selected is unique and it is in conflict with those predicted by the commonly used coalitional refinements. Furthermore, a conflict is found between stability and efficiency even when no such conflict exists with the coalitional refinements. We are especially grateful to Deborah Minehart, Roger Lagunoff, Daniel Vincent, Peter Cramton, Luca Anderlini, Axel Anderson, Felipe Zurita, Francis Bloch, Colin Stewart, the editor and three anonymous referees for their valuable comments that contributed to improve the paper. We also thank participants at the EEA-ESEM, Stockholm 2003, the IUSC conference, Columbia University 2003, and the Workshop on Global Games, SUNY, Stony Brook, 2007.     

Equilibrium selection through incomplete information in coordination games: an experimental study

We perform an experiment on a pure coordination game with uncertainty about the payoffs. Our game is closely related to models that have been used in many macroeconomic and financial applications to solve problems of equilibrium indeterminacy. In our experiment, each subject receives a noisy signal about the true payoffs. This game (inspired by the “global” games of Carlsson and van Damme, Econometrica, 61, 989–1018, 1993) has a unique strategy profile that survives the iterative deletion of strictly dominated strategies (thus a unique Nash equilibrium). The equilibrium outcome coincides, on average, with the risk-dominant equilibrium outcome of the underlying coordination game. In the baseline game, the behavior of the subjects converges to the theoretical prediction after enough experience has been gained. The data (and the comments) suggest that this behavior can be explained by learning. To test this hypothesis, we use a different game with incomplete information, related to a complete information game where learning and prior experiments suggest a different behavior. Indeed, in the second treatment, the behavior did not converge to equilibrium within 50 periods in some of the sessions. We also run both games under complete information. The results are sufficiently similar between complete and incomplete information to suggest that risk-dominance is also an important part of the explanation.      

On the limit perfect public equilibrium payoff set in repeated and stochastic games

This paper provides a dual characterization of the existing ones for the limit set of perfect public equilibrium payoffs in a class of finite stochastic games (in particular, repeated games) as the discount factor tends to one. As a first corollary, the folk theorems of Fudenberg et al. (1994), Kandori and Matsushima (1998) and Hörner et al. (2011) obtain. As a second corollary, it is shown that this limit set of payoffs is a convex polytope when attention is restricted to perfect public equilibria in pure strategies. This result fails for mixed strategies, even when attention is restricted to two-player repeated games.     

Waiting times and equilibrium selection

Summary. This paper shows how graphs can be used to calculate waiting times in models of equilibrium selection. It also shows how reducing the state space can simplify the calculations of both waiting times and selected equilibria. The results are applied to potential games and games with strategic complementarities.Received: 31 December 2002, Revised: 25 October 2003, JEL Classification Numbers: C72, C73.Alan Beggs: I am grateful to an anonymous referee for helpful comments.     

Existence of equilibrium in common agency games with adverse selection

We establish the existence of subgame perfect equilibria in general menu games, known to be sufficient to analyze common agency problems. Our main result states that every menu game satisfying enough continuity properties has a subgame perfect equilibrium. Despite the continuity assumptions that we make, discontinuities naturally arise due to the absence, in general, of continuous optimal choices for the agent. Our approach, then, is based on (and generalizes) the existence theorem of [Simon, L., Zame, W., 1990. Discontinuous games and endogenous sharing rules. Econometrica 58 (4), 861–872] designed for discontinuous games.     

Nash equilibrium and generalized integration for infinite normal form games

Infinite normal form games that are mathematically simple have been treated [ Harris, C.J., Stinchcombe, M.B., Zame, W.R., in press. Nearly compact and continuous normal form games: characterizations and equilibrium existence. Games Econ. Behav.]. Under study in this paper are the other infinite normal form games, a class that includes the normal forms of most extensive form games with infinite choice sets.Finitistic equilibria are the limits of approximate equilibria taken along generalized sequences of finite subsets of the strategy spaces. Points must be added to the strategy spaces to represent these limits. There are direct, nonstandard analysis, and indirect, compactification and selection, representations of these points. The compactification and selection approach was introduced [Simon, L.K., Zame, W.R., 1990. Discontinuous games and endogenous sharing rules. Econometrica 58, 861–872]. It allows for profitable deviations and introduces spurious correlation between players' choices. Finitistic equilibria are selection equilibria without these drawbacks. Selection equilibria have drawbacks, but contain a set-valued theory of integration for non-measurable functions tightly linked to, and illuminated by, the integration of correspondences.     

The equilibrium manifold keeps the memory of individual demand functions

Summary. It is shown that the property that the equilibrium manifold keeps the memory of the individual demand functions holds true if every individual demand function satisfies the following three properties: 1) It is a function of commodity prices and of consumers income; 2) Consumption belongs to the nonnegative orthant of the commodity space; 3) Walras law. Neither differentiability nor continuity are necessary. In addition, the demand functions do not have to be utility maximizing subject to budget constraints.Received: 2 September 2003, Revised: 26 January 2004, JEL Classification Numbers: D50, D51.A preliminary version of this paper was released in October 1999 under the title Deriving individual demand functions from the equilibrium manifold. I wish to thank an anonymous referee for thoughtful comments.     

Nearly compact and continuous normal form games: characterizations and equilibrium existence

Normal form games are nearly compact and continuous (NCC) if they can be understood as games played on strategy spaces that are dense subsets of the strategy spaces of larger compact games with jointly continuous payoffs. There are intrinsic algebraic, measure theoretic, functional analysis, and finite approximability characterizations of NCC games. NCC games have finitely additive equilibria, and all their finitely additive equilibria are equivalent to countably additive equilibria on metric compactifications. The equilibrium set of an NCC game depends upper hemicontinuously on the specification of the game and contains only the limits of approximate equilibria of approximate games.     

Random belief equilibrium in normal form games

In defining random belief equilibrium (RBE) in finite, normal form games we assume a player's beliefs about others' strategy choices are randomly drawn from a belief distribution that is dispersed around a central strategy profile, the focus. At an RBE: (1) Each chooses a best response relative to her beliefs. (2) Each player's expected choice coincides with the focus of the other players' belief distributions. RBE provides a statistical framework for estimation which we apply to data from three experimental games. We also characterize the limit-RBE as players' beliefs converge to certainty. When atoms in the belief distributions vanish in the limit, not all limit-RBE (called robust equilibria) are trembling hand perfect Nash equilibria and not all perfect equilibria are robust.     

Incentive monotonicity and equilibrium selection in 2×2 matrix games

For the class of 2×2 matrix games with two strict Nash equilibria the paper introduces an equilibrium refinement called incentive monotonicity. It selects the risk-dominant equilibrium if interests are conflicting, while it remains silent in games with common interests. These results suggest that the equilibrium-selection problem might be more difficult in games with common interests, which is certainly the case if risk dominance and payoff dominance go in opposite directions.     

The evolution of conventions in minimum effort games

The literature on minimum effort game has been concerned with a symmetric game with linear payoff functions. The main aim of the present paper is to study the coordination problem arising in a not necessarily symmetric minimum effort game with two players. The sources of asymmetry can be twofold: the productivity of effort and the distribution of the join output. To select among the Pareto ranked equilibria we use the stochastic stability criterion. We show that, for any configuration parameters, the set of stochastically stable equilibria coincides with the set of potential maximizers. We also show that when the disutility of effort is linear, the Pareto dominant equilibrium is stochastically stable provided that the distributive parameter belongs to a well defined range. When the disutility of effort is nonlinear no distributive arguments can be used to successfully affect the selection process. Lastly we prove that the connection between stochastic stability and maximum potential can fail when more than two agents are considered.     

Stochastic strategy adjustment in coordination games

Summary. The paper explores a model of equilibrium selection in coordination games, where agents from an infinite population stochastically adjust their strategies to changes in their local environment. Instead of playing perturbed best-response, it is assumed that agents follow a rule of ‘switching to better strategies with higher probability’. This behavioral rule is related to bounded-rationality models of Rosenthal (1989) and Schlag (1998). Moreover, agents stay with their strategy in case they successfully coordinate with their local neighbors. Our main results show that both strict Nash equilibria of the coordination game correspond to invariant distributions of the process, hence evolution of play is not ergodic but instead depends on initial conditions. However, coordination on the risk-dominant equilibrium occurs with probability one whenever the initial fraction contains infinitely many agents, independent of the spatial distribution of these agents. Received: March 14, 2000; revised version: June 21, 2001     

Nash equilibrium in games with incomplete preferences

Summary. This paper investigates Nash equilibrium under the possibility that preferences may be incomplete. I characterize the Nash-equilibrium-set of such a game as the union of the Nash-equilibrium-sets of certain derived games with complete preferences. These games with complete preferences can be derived from the original game by a simple linear procedure, provided that preferences admit a concave vector-representation. These theorems extend some results on finite games by Shapley and Aumann. The applicability of the theoretical results is illustrated with examples from oligopolistic theory, where firms are modelled to aim at maximizing both profits and sales (and thus have multiple objectives). Mixed strategy and trembling hand perfect equilibria are also discussed.Received: 22 September 2003, Revised: 24 June 2004, JEL Classification Numbers: D11, C72, D43.I would like to thank Jean-Pierre Benôit, Juan Dubra, Alejandrio Jofre, Debraj Ray, Kim-Sau Chung and the seminar participants at NYU and at the Universidad de Chile for their comments. I am most grateful to Efe Ok, for his comments, criticism, suggestions and questions.     

A note on control costs and logit rules for strategic games

We consider best response dynamics with endogenous noise based on a finite game in strategic form. A player can reduce the noise level by expending an extra effort and incurring some disutility or control costs. We specify control costs that result in logit adjustment rules. The stochastically stable states of the dynamic process are partial Nash configurations, that is, states where at least one player plays a best response against the others. If the game has a potential, then the stochastically stable states coincide with the Nash equilibria on which the potential is maximized. RID="*" ID="*" Instructive comments of a referee are gratefully acknowledged. Correspondence to:H. Haller     

Congestion games with malicious players

We study the equilibria of non-atomic congestion games in which there are two types of players: rational players, who seek to minimize their own delay, and malicious players, who seek to maximize the average delay experienced by the rational players. We study the existence of pure and mixed Nash equilibria for these games, and we seek to quantify the impact of the malicious players on the equilibrium. One counterintuitive phenomenon which we demonstrate is the “windfall of malice”: paradoxically, when a myopically malicious player gains control of a fraction of the flow, the new equilibrium may be more favorable for the remaining rational players than the previous equilibrium.     

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

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.     

Equilibrium play in matches: Binary Markov games

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of the match for the players, at each point, to play a Nash equilibrium of the point game; (b) it is a minimax behavior strategy in the match for a player to play minimax in each point game; and (c) when the point games all have unique Nash equilibria, the only Nash equilibrium of the binary Markov game consists of minimax play at each point. An application to tennis is provided.     

An application of Ramsey theorem to stopping games

We prove that every two-player nonzero-sum deterministic stopping game with uniformly bounded payoffs admits an -equilibrium, for every >0. The proof uses Ramsey Theorem that states that for every coloring of a complete infinite graph by finitely many colors there is a complete infinite subgraph which is monochromatic.