The Statistical Mechanics of Best-Response Strategy Revision

This paper compares local and global strategic interaction when players update using the (myopic) best-response rule. I show that randomizing the order in which players update their strategic choice suffices to achieve coordination on the risk-dominant strategy in symmetric 2 × 2 coordination games. The "persistant randomness" which is necessary to achieve similar coordination with global interaction is replaced under local interaction by spatial variation in the initial condition. An extension of the risk-dominance idea gives the same convergence result for K × K games with strategic complementarities. Similar results for K × K pure coordination games and potential games are also presented. Journal of Economic Literature Classification Number: C78.     

Extensive-form games and strategic complementarities

I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a nonempty, complete lattice—in particular, subgame-perfect Nash equilibria exist. For this purpose I introduce a device that allows the study of the set of subgame-perfect equilibria as the set of fixed points of a correspondence. My results are limited because extensive-form games of strategic complementarities turn out—surprisingly—to be a very restrictive class of games.     

A characterization of strategic complementarities

I characterize games for which there is an order on strategies such that the game has strategic complementarities. I prove that, with some qualifications, games with a unique equilibrium have complementarities if and only if Cournot best-response dynamics has no cycles; and that all games with multiple equilibria have complementarities. As applications of my results, I show that: (1) generic 2×2 games either have no pure-strategy equilibria, or have complementarities; (2) generic two-player finite ordinal potential games have complementarities.     

Non-monotoniticies and the all-pay auction tie-breaking rule

Discontinuous games, such as auctions, may require special tie-breaking rules to guarantee equilibrium existence. The best results available ensure equilibrium existence only in mixed strategy with endogenously defined tie-breaking rules and communication of private information. We show that an all-pay auction tie-breaking rule is sufficient for the existence of pure strategy equilibrium in a class of auctions. The rule is explicitly defined and does not require communication of private information. We also characterize when special tie-breaking rules are really needed.      

GLOBAL GAMES WITH STRATEGIC SUBSTITUTES

We study global games with strategic substitutes. Specifically, for a class of binary‐action, ‐player games with strategic substitutes, we prove that under payoff asymmetry, as incomplete information vanishes, the global games approach selects a unique equilibrium. We characterize this equilibrium profile ; players employ switching strategies at different cutoff signals, the order of which is directly determined by payoff asymmetry. We provide examples that illustrate our result and its connection with dominance solvability. We extend the global game literature, which has thus far been developed for games with strategic complementarities, to new applications in industrial organization, collective action problems, finance, etc .     

Monotone equilibria in Bayesian games of strategic complementarities

For Bayesian games of strategic complementarities, we provide a constructive proof of the existence of a greatest and a least Bayesian Nash equilibrium, each one in strategies that are monotone in type. Our main assumptions, besides strategic complementarities, are that each player's payoff displays increasing differences in own action and the profile of types and that each player's interim beliefs are increasing in type with respect to first-order stochastic dominance (e.g., types are affiliated). The result holds for general action and type spaces (single-, multi-, or infinite-dimensional; continuous or discrete) and no prior is assumed. We also provide the following comparative statics result: the greatest and least equilibria are higher if there is a first-order stochastic dominant shift in the interim beliefs. We apply this result to strategic information revelation in games of voluntary disclosure.     

Mixed equilibria are unstable in games of strategic complements

In games with strict strategic complementarities, properly mixed Nash equilibria—equilibria that are not in pure strategies—are unstable for a broad class of learning dynamics.     

A contraction principle for finite global games

I provide a new proof of uniqueness of equilibrium in a wide class of global games. I show that the joint best-response in these games is a contraction. The uniqueness result then follows as a corollary of the contraction principle. Furthermore, the contraction-mapping approach provides an intuition for why uniqueness arises: complementarities in games generate multiplicity of equilibria, but the global-games structure dampens complementarities so that only one equilibrium exists.     

Noise-independent selection in multidimensional global games

This paper examines many-player many-action global games with multidimensional state parameters. It establishes that the notion of noise-independent selection introduced by Frankel, Morris and Pauzner [D. Frankel, S. Morris, A. Pauzner, Equilibrium selection in global games with strategic complementarities, J. Econ. Theory 108 (2003) 1–44] for one-dimensional global games is robust when the setting is extended to the one proposed by Carlsson and Van Damme [H. Carlsson, E. Van Damme, Global games and Equilibrium selection, Econometrica 61 (1993) 989–1018]. More precisely, our main result states that if an action profile of some complete information game is noise-independently selected in one-dimensional global games, then it is also noise-independently selected in all multidimensional global games.     

Variational convergence: Approximation and existence of equilibria in discontinuous games

We introduce a notion of variational convergence for sequences of games and we show that the Nash equilibrium map is upper semi-continuous with respect to variationally converging sequences. We then show that for a game G with discontinuous payoff, some of the most important existence results of Dasgupta and Maskin, Simon, and Reny are based on constructing approximating sequences of games that variationally converge to G. In fact, this notion of convergence will help simplify these results and make their proofs more transparent. Finally, we use our notion of convergence to establish the existence of a Nash equilibrium for Bertrand-Edgeworth games with very general forms of tie-breaking and residual demand rules.     

Measuring Strategic Uncertainty in Coordination Games

This paper proposes a method to measure strategic uncertainty by eliciting certainty equivalents analogous to measuring risk attitudes in lotteries. We apply this method by conducting experiments on a class of one-shot coordination games with strategic complementarities and choices between simple lotteries and sure payoff alternatives, both framed in a similar way. Despite the multiplicity of equilibria in the coordination games, aggregate behaviour is fairly predictable. The pure or mixed Nash equilibria cannot describe subjects' behaviour. We present two global games with private information about monetary payoffs and about risk aversion. While previous literature treats the parameters of a global game as given, we estimate them and show that both models describe observed behaviour well. The global-game selection for vanishing noise of private signals offers a good recommendation for actual players, given the observed distribution of actions. We also deduce subjective beliefs and compare them with objective probabilities.     

Catalog competition and Nash equilibrium in nonlinear pricing games

We model strategic competition in a market with asymmetric information as a noncooperative game in which each seller competes for a buyer of unknown type by offering the buyer a catalog of products and prices. We call this game a catalog game. Our main objective is to show that catalog games have Nash equilibria. The Nash existence problem for catalog games is particularly contentious due to payoff discontinuities caused by tie-breaking. We make three contributions. First, we establish under very mild conditions on primitives that no matter what the tie-breaking rule, catalog games are uniformly payoff secure, and therefore have mixed extensions which are payoff secure. Second, we show that if the tie-breaking rule awards the sale to firms which value it most (i.e., breaks ties in favor of firms which stand to make the highest profit), then firm profits are reciprocally upper semicontinuous (i.e., the mixed catalog game is reciprocally upper semincontinuous). This in turn implies that the mixed catalog game satisfies Reny’s condition of better-reply security—a condition sufficient for existence (Reny in Econometrica 67:1029–1056, 1999). Third, we show by example that if the tie-breaking rule does not award the sale to firms which value it most (for example, if ties are broken randomly with equal probability), then the catalog game has no Nash equilibrium. This paper was written while the second author was Visiting Professor, Centre d’Economie de la Sorbonne, Universite Paris 1, Pantheon-Sorbonne. The second author thanks CES and Paris 1, and in particular, Bernard Cornet and Cuong Le Van for their support and hospitality. The second author also thanks the C&BA and EFLS at the University of Alabama for financial support. Both authors are grateful to Monique Florenzano and to participants in the April 2006 Paris 1 NSF/NBER Decentralization Conference for many helpful comments on an earlier version of the paper. Finally, both authors are especially grateful to an anonymous referee whose thoughtful comments led to substantial improvements in the paper. Monteiro acknowleges the financial support of Capes-Cofecub 468/04.     

Games of strategic complementarities: an application to Bayesian games

This paper provides an introduction to the theory of games of strategic complementarities, considers Bayesian games, and provides an application to global games. This paper is based on the Spanish Economic Review lecture given at the Simposio de Análisis Económico, Alicante, December 2001. Support from the Spanish Ministry of Education and Science (project SEJ2005-08263) is gratefully acknowledged.     

Cooperation in Experimental Games of Strategic Complements and Substitutes

We conduct a laboratory experiment aimed at examining whether strategic substitutability and strategic complementarity have an impact on the tendency to cooperate in finitely repeated two-player games with a Pareto-inefficient Nash equilibrium. We find that there is significantly more cooperation when actions exhibit strategic complementarities than in the case of strategic substitutes. The difference is to some extent driven by a difference in the speed with which some pairs reach stable full cooperation, but mainly by differences in choices of pairs that do not succeed in reaching full cooperation.     

Equilibrium selection in global games with strategic complementarities

We study games with strategic complementarities, arbitrary numbers of players and actions, and slightly noisy payoff signals. We prove limit uniqueness: as the signal noise vanishes, the game has a unique strategy profile that survives iterative dominance. This generalizes a result of Carlsson and van Damme (Econometrica 61 (1993) 989-1018) for two-player, two-action games. The surviving profile, however, may depend on fine details of the structure of the noise. We provide sufficient conditions on payoffs for there to be noise-independent selection.     

Finding all equilibria in games of strategic complements

I present a simple and fast algorithm that finds all the pure-strategy Nash equilibria in games with strategic complementarities. This is the first non-trivial algorithm for finding all pure-strategy Nash equilibria.     

Coordination and learning in games with strategic substitutes and complements

This paper experimentally compares the impact of the presence of strategic substitutes (GSS) and complements (GSC) on players’ ability to successfully play equilibrium strategies. By exploiting a simple property of the ordering on strategy spaces, our design allows us to isolate these effects by avoiding other confounding factors that are present in more complex settings, such as market games. We find that the presence of strategic complementarities significantly improves the rate of Nash play, but that this effect is driven mainly by early rounds of play. This suggests that GSS may be more difficult to learn initially, but that given sufficient time, the theoretically supported globally stable equilibrium offers a good prediction in both settings. We also show that increasing the degree of substitutability or complementarity does not significantly improve the rate of Nash play in either setting, which builds on the findings of previous studies.     

Mixed equilibria in games of strategic complementarities

Summary. The literature on games of strategic complementarities (GSC) has focused on pure strategies. I introduce mixed strategies and show that, when strategy spaces are one-dimensional, the complementarities framework extends to mixed strategies ordered by first-order stochastic dominance. In particular, the mixed extension of a GSC is a GSC, the full set of equilibria is a complete lattice and the extremal equilibria (smallest and largest) are in pure strategies. The framework does not extend when strategy spaces are multi-dimensional. I also update learning results for GSC using stochastic fictitious play. Received: October 16, 2000; revised version: March 7, 2002 RID="*" ID="*" I am very grateful to Robert Anderson, David Blackwell, Aaron Edlin, Peter De Marzo, Ted O'Donoghue, Matthew Rabin, Ilya Segal, Chris Shannon, Clara Wang and Federico Weinschelbaum for comments and advise.     

The One-Shot-Deviation Principle for Sequential Rationality

This article analyzes the fictitious play process originally proposed for strategic form games by Brown (1951) and Robinson (1951). We interpret the process as a model of preplay thinking performed by players before acting in a one-shot game. This model is one of bounded rationality. We discuss how fictitious play should then be defined for extensive form games and conclude that this is somewhat problematic. We therefore study two alternative definitions. For either of these, under a weak condition of initial uncertainty, a convergence point of a fictitious play sequence is a sequential equilibrium. For generic games of perfect information initial uncertainty also implies convergence of fictitious play.Journal of Economic LiteratureClassification Number: C72.     

Fictitious Play in Extensive Form Games

This article analyzes the fictitious play process originally proposed for strategic form games by Brown (1951) and Robinson (1951). We interpret the process as a model of preplay thinking performed by players before acting in a one-shot game. This model is one of bounded rationality. We discuss how fictitious play should then be defined for extensive form games and conclude that this is somewhat problematic. We therefore study two alternative definitions. For either of these, under a weak condition of initial uncertainty, a convergence point of a fictitious play sequence is a sequential equilibrium. For generic games of perfect information initial uncertainty also implies convergence of fictitious play.Journal of Economic LiteratureClassification Number: C72.