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     

Markov Perfect Equilibrium: I. Observable Actions

We define Markov strategy and Markov perfect equilibrium (MPE) for games with observable actions. Informally, a Markov strategy depends only on payoff-relevant past events. More precisely, it is measurable with respect to the coarsest partition of histories for which, if all other players use measurable strategies, each player's decision-problem is also measurable. For many games, this definition is equivalent to a simple affine invariance condition. We also show that an MPE is generically robust: if payoffs of a generic game are perturbed, there exists an almost Markovian equilibrium in the perturbed game near the initial MPE. Journal of Economic Literature Classification Numbers: C72, C73.     

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.     

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.     

Best response equivalence

Two games are best-response equivalent if they have the same best-response correspondence. We provide a characterization of when two games are best-response equivalent. The characterizations exploit a dual relationship between payoff differences and beliefs. Some “potential game” arguments [Games Econ. Behav. 14 (1996) 124] rely only on the property that potential games are best-response equivalent to identical interest games. Our results show that a large class of games are best-response equivalent to identical interest games, but are not potential games. Thus we show how some existing potential game arguments can be extended.     

On the Relationship between Risk-Dominance and Stochastic Stability

In a 2 × 2 symmetric game with two symmetric equilibria, one risk-dominates another if and only if the equilibrium strategy is a unique best response to any mixture that gives itself at least a probability of one-half. In a two-person strategic form game, we call a Nash equilibriumglobally risk-dominantif it consists of strategies such that each one of them is a unique best response to any mixture that gives the other at least a probability of one-half. We show that if a weakly acyclic two-person game has a globally risk-dominant equilibrium, then this is the one that is selected by the stochastic equilibrium selection process of Young.Journal of Economic LiteratureClassification Numbers: C72, C73.     

Lexicographic composition of simple games

Certain voting bodies can be modeled as a simple game where a coalition's winning depends on whether it wins, blocks or loses in two smaller simple games. There are essentially five such ways to combine two proper games into a proper game. The most decisive is the lexicographic rule, where a coalition must either win in G₁, or block in G₁ and win in G₂. When two isomorphic games are combined lexicographically, a given role for a player confers equal or more power when held in the first game than the second, if power is assessed by any semi-value. A game is lexicographically separable when the players of the two components partition the whole set. Games with veto players are not separable, and games of two or more players with identical roles are separable only if decisive. Some separable games are egalitarian in that they give players identical roles.     

Cycling in a stochastic learning algorithm for normal form games

In this paper we study a stochastic learning model for 2×2 normal form games that are played repeatedly. The main emphasis is put on the emergence of cycles. We assume that the players have neither information about the payoff matrix of their opponent nor about their own. At every round each player can only observe his or her action and the payoff he or she receives. We prove that the learning algorithm, which is modeled by an urn scheme proposed by Arthur (1993), leads with positive probability to a cycling of strategy profiles if the game has a mixed Nash equilibrium. In case there are strict Nash equilibria, the learning process converges a.s. to the set of Nash equilibria.     

Dynamics in near-potential games

We consider discrete-time learning dynamics in finite strategic form games, and show that games that are close to a potential game inherit many of the dynamical properties of potential games. We first study the evolution of the sequence of pure strategy profiles under better/best response dynamics. We show that this sequence converges to a (pure) approximate equilibrium set whose size is a function of the “distance” to a given nearby potential game. We then focus on logit response dynamics, and provide a characterization of the limiting outcome in terms of the distance of the game to a given potential game and the corresponding potential function. Finally, we turn attention to fictitious play, and establish that in near-potential games the sequence of empirical frequencies of player actions converges to a neighborhood of (mixed) equilibria, where the size of the neighborhood increases according to the distance to the set of potential games.     

Learning with perfect information

For extensive form games with perfect information, consider a learning process in which, at any iteration, each player unilaterally deviates to a best response to his current conjectures of others' strategies; and then updates his conjectures in accordance with the induced play of the game. We show that, for generic payoffs, the outcome of the game becomes stationary, and is consistent with Nash equilibrium. In general, if payoffs have ties or if players observe more of each others' strategies than is revealed by plays of the game, the same result holds provided a rationality constraint is imposed on unilateral deviations: no player changes his moves in subgames that he deems unreachable, unless he stands to improve his payoff there. Moreover, with this constraint, the sequence of strategies and conjectures also becomes stationary, and yields a self-confirming equilibrium.     

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     

Stochastic Cooperative Games: Superadditivity, Convexity, and Certainty Equivalents

This paper extends the notions of superadditivity and convexity to stochastic cooperative games. It is shown that convex games are superadditive and have nonempty cores, and that these results also hold in the context of NTU games. Furthermore, a subclass of stochastic cooperative games to which one can associate a deterministic cooperative game is considered. It is shown that such a stochastic cooperative game satisfies properties like nonemptiness of the core, superadditivity, and convexity if and only if the corresponding deterministic game satisfies these properties.Journal of Economic LiteratureClassification Number: C71.     

Environmental Policy with Endogenous Plant Locations

In a game between the governments of two countries, each chooses its own environmental policy. The Nash equilibria of the game are generally not Pareto optimal. On the one hand, each country may want to attract industry, giving it an incentive to choose low environmental taxes or standards. On the other hand, if disutility from pollution is sufficiently high, each country might prefer that a firm locates only in other countries. This effect tends to make the environmental policy under non-cooperation stricter than it would be with cooperation.     

Coordination of strategic responses to security threats: Laboratory evidence

Laboratory experiments are used to evaluate the extent to which players in games can coordinate investments that diminish the probability of losses due to security breaches or terrorist attacks. In this environment, economically sensible investments may be foregone if their potential benefits are negated by failures to invest in security at other sites. The result is a coordination game with a desirable high-payoff, high-security equilibrium and an undesirable low-security equilibrium that may result if players do not expect others to invest in security. One unique feature of this coordination situation is that investment in security by one player generates a positive externality such that all other players’ expected payoffs are increased, regardless of those other players’ investment decisions. Coordination failures are pervasive in a baseline experiment with simultaneous decisions, but coordination is improved if players are allowed to move in an endogenously determined sequence. In addition, coordinated security investments are observed more often when the largest single security threat to individuals is preventable by their own decisions to invest in security. The security coordination game is a “potential game,” and the success of coordination on the more secure equilibrium is related to the notion of potential function maximization and basin of attraction.      

p-Dominance and Equilibrium Selection under Perfect Foresight Dynamics

This paper studies equilibrium selection based on a class of perfect foresight dynamics and relates it to the notion of p-dominance. A continuum of rational players is repeatedly and randomly matched to play a symmetric n×n game. There are frictions: opportunities to revise actions follow independent Poisson processes. The dynamics has stationary states, each of which corresponds to a Nash equilibrium of the static game. A strict Nash equilibrium is linearly stable under the perfect foresight dynamics if, independent of the current action distribution, there exists a consistent belief that any player necessarily plays the Nash equilibrium action at every revision opportunity. It is shown that a strict Nash equilibrium is linearly stable under the perfect foresight dynamics with a small degree of friction if and only if it is the p-dominant equilibrium with p<1/2. It is also shown that if a strict Nash equilibrium is the p-dominant equilibrium with p<1/2, then it is uniquely absorbing (and globally accessible) for a small friction (but not vice versa). Set-valued stability concepts are introduced and their existence is shown. Journal of Economic Literature Classification Numbers: C72, C73.     

Stated beliefs versus inferred beliefs: A methodological inquiry and experimental test

Belief elicitation in game experiments may be problematic if it changes game play. We experimentally verify that belief elicitation can alter paths of play in a two-player repeated asymmetric matching pennies game. Importantly, this effect occurs only during early periods and only for players with strongly asymmetric payoffs, consistent with a cognitive/affective effect on priors that may serve as a substitute for experience. These effects occur with a common scoring rule elicitation procedure, but not with simpler (unmotivated) statements of expected choices of opponents. Scoring rule belief elicitation improves the goodness of fit of structural models of belief learning, and prior beliefs implied by such models are both stronger and more realistic when beliefs are elicited than when they are not. We also find that “inferred beliefs” (beliefs estimated from past observed actions of opponents) can predict observed actions better than the “stated beliefs” from scoring rule belief elicitation.     

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.     

Absorbing Team Games

A team is a group of people having the same motives but possibly different available actions. A team game is a game where two teams face each other. An absorbing game is a repeated game where some of the entries are absorbing, in the sense that once they are chosen the play terminates, and all future payoffs are equal to the payoff at the stage of termination. We prove that every absorbing team game has an equilibrium payoff and that there are -equilibrium profiles with cyclic structure. Journal of Economic Literature Classification Numbers: C72, C73.     

Non-Laplacian beliefs in a global game with noisy signaling

In standard global games, individual behavior is optimal if it constitutes a best response to agnostic—Laplacian—beliefs about the aggregate behavior of other agents. This paper considers a standard binary action global game augmented with noisy signaling by an informed policy-maker and shows that in this game, equilibrium beliefs depart in quite stark ways from the Laplacian benchmark. In the limit as signals become arbitrarily precise, so that all fundamental uncertainty is removed (leaving only strategic uncertainty), the equilibrium beliefs of the marginal individual concerning the aggregate action collapse to a discrete Bernoulli distribution, giving probability mass only to the polar extreme outcomes. By contrast in the underlying standard global game the marginal individual believes the aggregate action has a continuous uniform distribution, giving equal likelihood to all possible outcomes.