Characterising equilibrium selection in global games with strategic complementarities

Global games are widely used to predict behaviour in games with strategic complementarities and multiple equilibria. We establish two results on the global game selection. First, we show that, for any supermodular complete information game, the global game selection is independent of the payoff functions chosen for the game?s global game embedding. Second, we give a simple sufficient criterion to derive the selection and establish noise independence in many-action games by decomposing them into games with smaller action sets, to which we may often apply simple criteria. We also report in which small games noise independence may be established by counting the number of players or actions.     

Lotteries, Sunspots, and Incentive Constraints

We study a prototypical class of exchange economies with private information and indivisibilities. We establish an equivalence between lottery equilibria and sunspot equilibria and show that the welfare and existence theorems hold. To establish these results, we introduce the concept of the stand-in consumer economy, which is a standard, convex, finite consumer, finite good, pure exchange economy. With decreasing absolute risk aversion and no indivisibilities, we prove that no lotteries are actually used in equilibrium. We provide a simple numerical example with increasing absolute risk aversion in which lotteries are necessarily used in equilibrium. We also show how the equilibrium allocation in this example can be implemented in a sunspot equilibrium. Journal of Economic Literature Classification Numbers: D11, D50, D82.     

Learning and sophistication in coordination games

This paper studies the role of strategic teaching in coordination games and whether changing the incentives of players to teach leads to more efficient coordination. We ran experiments where subjects played one of four coordination games in constant pairings, where the incentives to teach were varied along two dimensions—the short run cost of teaching and the long run benefit to teaching. We show which aspects of the game lead subjects to adopt long run teaching strategies, and show that subjects try to manipulate their opponent’s actions to pull them out of a situation of coordination failure. We also show that extending a model of decision making by introducing a forward-looking component helps to track teachers’ behaviour more accurately, and describes the way players behave in a more unified way across both teachers and learners.     

Infinite Histories and Steady Orbits in Repeated Games

We study a model of repeated games with the following features: (a) Infinite histories. The game has been played since days of yore, or is so perceived by the players: (b) Turing machines with memory. Since regular Turing machines coincide with bounded recall strategies (in the presence of infinite histories), we endow them with "external" memory; (c) Nonstrategic players. The players ignore complicated strategic considerations and speculations about them. Instead, each player uses his/her machine to update some statistics regarding the others′ behaviour, and chooses a best response to observed behaviour. Relying on these assumptions, we define a solution concept for the one shot game, called steady orbit. The (closure of the) set of steady orbit payoffs strictly includes the convex hull of the Nash equilibria payoffs and is strictly included in the correlated equilibria payoffs. Assumptions (a)–(c) above are independent to a large extent. In particular, one may define steady orbits without explicitly dealing with histories or machines.     

Dynamic coordination with individual learning

We study coordination in dynamic global games with private learning. Players choose whether and when to invest irreversibly in a project whose success depends on its quality and the timing of investment. Players gradually learn about project quality. We identify conditions on temporal incentives under which, in sufficiently long games, players coordinate on investing whenever doing so is not dominated. Roughly speaking, this outcome occurs whenever players? payoffs are sufficiently tolerant of non-simultaneous coordination. We also identify conditions under which players coordinate on the risk-dominant action. We provide foundations for these results in terms of higher order beliefs.     

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.     

Equilibrium Selection inn-Person Coordination Games

This paper investigates several approaches to equilibrium selection and the relationships between them. The class of games we study aren-person generalized coordination games with multiple Pareto rankable strict Nash equilibria. The main result is that all selection criteria select the same outcome (namely the risk dominant equilibrium) in two-person games, and that most equivalences break for games with more than two players. All criteria select the Pareto efficient equilibrium in voting games, of which pure coordination games are special cases.Journal of Economic LiteratureClassification Numbers: C70, C72, D82.     

Existence of perfect equilibria: a direct proof

We provide a direct proof of the existence of perfect equilibria in finite normal form games and extensive games with perfect recall. It is done by constructing a correspondence whose fixed points are precisely the perfect equilibria of a given finite game. Existence of a fixed point is secured by a generalization of Kakutani theorem, which is proved in this paper. This work offers a new approach to perfect equilibria, which would hopefully facilitate further study on this topic. We also hope our direct proof would be the first step toward building an algorithm to find the set of all perfect equilibria of a strategic game.     

Bayesian games with unawareness and unawareness perfection

Applying unawareness belief structures introduced in Heifetz et al. (Games Econ Behav 77:100–121, 2013a), we develop Bayesian games with unawareness, define equilibrium, and prove existence. We show how equilibria are extended naturally from lower to higher awareness levels and restricted from higher to lower awareness levels. We apply Bayesian games with unawareness to investigate the robustness of equilibria to uncertainty about opponents’ awareness of actions. We show that a Nash equilibrium of a strategic game is robust to unawareness of actions if and only if it is not weakly dominated. Finally, we discuss the relationship between standard Bayesian games and Bayesian games with unawareness.     

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.     

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.     

An International Comparison and Analysis of Lotteries and the Distribution of Lottery Expenditures

Lotteries are found in nearly half of the world's countries, with annual worldwide lottery ticket sales topping $115 billion. Despite the global presence of lottery games, there has been little research conducted on any international aspect of lotteries. This paper presents the first-ever examination and comparison of lottery games from around the world. Differences in both absolute and relative lottery expenditures are presented. Estimates for the income elasticity of demand for lottery tickets provide evidence on the distributional burden of lottery expenditures. These estimates consider each country by continental location and country income level. Further analysis reveals that lower income countries could adopt Lotto games in order to increase revenues. Recognizing that the distributional impact of lottery games is one of the greatest concerns surrounding lotteries, it is shown that the introduction of Lotto games does not significantly affect the distributional burden of lottery ticket expenditures. Given the international scope of lotteries and the availability of international lottery game data, the paper concludes by discussing future research on international lottery games.     

On Sustaining Cooperation without Public Observations

This paper examines a dynamic game in which each player only observes a private and imperfect signal on the actions played. Our main result is that in a repeated prisoner's dilemma where defections are irreversible (at least for a long enough period of time), patient enough players may achieve almost efficient outcomes. Dealing with models of imperfect private monitoring is difficult because (i) continuation games are games of incomplete information, hence they do not have the same structure as the original game. In particular, continuation equilibria are correlated equilibria. (ii) Players are typically uncertain about their opponents' past observations and actions, and they use their entire own private history to learn about these actions. As a result equilibrium strategies are in general nontrivial and increasingly complex functions of past observations. We bypass these difficulties by looking at correlated equilibria of the original game and find correlated equilibria in which the decision problem faced by each player remains the same over time. Journal of Economic Literature Classification Numbers: C72.     

Measuring agents’ reaction to private and public information in games with strategic complementarities

In games with strategic complementarities, public information about the state of the world has a larger impact on equilibrium actions than private information of the same precision, because public signals are more informative about the likely behavior of others. We present an experiment in which agents’ optimal actions are a weighted average of the fundamental state and their expectations of other agents’ actions. We measure the responses to public and private signals. We find that, on average, subjects put a larger weight on the public signal. In line with theoretical predictions, as the relative weight of the coordination component in a player’s utility increases, players put more weight on the public signal when making their choices. However, the weight is smaller than in equilibrium, which indicates that subjects underestimate the information contained in public signals about other players’ beliefs.     

When and why? A critical survey on coordination failure in the laboratory

Coordination games with Pareto-ranked equilibria have attracted major attention over the past two decades. Two early path-breaking sets of experimental studies were widely interpreted as suggesting that coordination failure is a common phenomenon in the laboratory. We identify the major determinants that seem to affect the incidence, and/or emergence, of coordination failure in the lab and review critically the existing experimental studies on coordination games with Pareto-ranked equilibria since that early evidence emerged. We conclude that there are many ways to engineer coordination successes.      

Equilibrium tracing in strategic-form games

We analyze the relationships of the van den Elzen–Talman algorithm, the Lemke–Howson algorithm and the global Newton method for equilibrium computation by Govindan and Wilson. For two-player games, all three can be implemented as complementary pivoting algorithms. The algorithms by Lemke and Howson and by van den Elzen and Talman start at a pair of strategies: the first method at a pure strategy and its best reply, the latter anywhere in the strategy space. However, we show that even with the same starting point they may find different equilibria. Our second result is that the van den Elzen–Talman algorithm is a special case of the global Newton method, which was known only for the Lemke–Howson algorithm. More generally, the global Newton method implements the linear tracing procedure for any number of players. All three algorithms find generically only equilibria of positive index. Even though the van den Elzen–Talman algorithm is extremely flexible in the choice of starting point, we show that there are generic coordination games where the completely mixed equilibrium, which has positive index, is generically not found by the algorithm.     

Robustness to strategic uncertainty

We introduce a criterion for robustness to strategic uncertainty in games with continuum strategy sets. We model a player's uncertainty about another player's strategy as an atomless probability distribution over that player's strategy set. We call a strategy profile robust to strategic uncertainty if it is the limit, as uncertainty vanishes, of some sequence of strategy profiles in which every player's strategy is optimal under his or her uncertainty about the others. When payoff functions are continuous we show that our criterion is a refinement of Nash equilibrium and we also give sufficient conditions for existence of a robust strategy profile. In addition, we apply the criterion to Bertrand games with convex costs, a class of games with discontinuous payoff functions and a continuum of Nash equilibria. We show that it then selects a unique Nash equilibrium, in agreement with some recent experimental findings.     

The Explanatory Power of Game Theory in International Politics: Syrian–Israeli Crisis Interactions, 1951–87

The present paper assesses the usefulness of game theory in explaining crisis interactions between Israel and Syria. We begin with the simplest game-theoretic tool for analyzing strategic situations: the one-shot 2×2 game. By analyzing the various episodes of the protracted Syrian--Israeli conflict as one-shot 2×2 games, we avoid the multiplicity of equilibria of the infinitely repeated game and the difficulty of specifying an endpoint of a finitely repeated game. The pure strategy Nash equilibria of these one-shot games are treated as theoretical predictions and are compared with the observed outcomes.     

Does information transparency decrease coordination failure?

We test the effect of information transparency on the probability of coordination failure in games with finite signals. Prior theory has shown that the effect of information transparency is ambiguous. Our study is based on two insights. Where signal space is finite, increased transparency usually destroys uniqueness of equilibria; and increasing transparency can reverse the risk-dominance ordering of equilibria. Our experiments show that increasing transparency improves coordination only when transparency makes the efficient equilibrium risk dominant. Coordination is degraded when increased transparency causes the secure equilibrium to be risk dominant. These results are consistent with subjects holding level-1 beliefs.     

When less information is good enough: experiments with global stag hunt games

There is mixed evidence on whether subjects coordinate on the efficient equilibrium in experimental stag hunt games under complete information. A design that generates an anomalously high level of coordination, Rankin et al. (Games Econo Behav 32(2):315–337, 2000), varies payoffs each period in repeated play rather than holding them constant. These payoff “perturbations” are eerily similar to those used to motivate the theory of global games, except the theory operates under incomplete information. Interestingly, that equilibrium selection concept is known to coincide with risk dominance, rather than payoff dominance. Thus, in theory, a small change in experimental design should produce a different equilibrium outcome. We examine this prediction in two treatments. In one, we use public signals to match Rankin et al. (2000)’s design; in the other, we use private signals to match the canonical example of global games theory. We find little difference between treatments, in both cases, subject play approaches payoff dominance. Our literature review reveals this result may have more to do with the idiosyncrasies of our complete information framework than the superiority of payoff dominance as an equilibrium selection principle.