Aggregate comparative statics

In aggregative games, each playerʼs payoff depends on her own actions and an aggregate of the actions of all the players. Many common games in industrial organization, political economy, public economics, and macroeconomics can be cast as aggregative games. This paper provides a general and tractable framework for comparative static results in aggregative games. We focus on two classes of games: (1) aggregative games with strategic substitutes and (2) nice aggregative games, where payoff functions are continuous and concave in own strategies. We provide simple sufficient conditions under which positive shocks to individual players increase their own actions and have monotone effects on the aggregate. The results are illustrated with applications to public good provision, contests, Cournot competition and technology choices in oligopoly.     

Robustness of equilibria in anonymous local games

This paper studies the robustness of symmetric equilibria in anonymous local games to perturbations of prior beliefs. Two priors are strategically close on a class of games if players receive similar expected payoffs in equilibrium under the priors, for any game in that class. I show that if the structure of payoff interdependencies is sparse in a well-defined sense, the conditions for strategic proximity in anonymous local games are strictly weaker than the conditions for general Bayesian games of Kajii and Morris (1998) [11] when attention is restricted to symmetric equilibria. Hence, by exploiting the properties of anonymous local games, it is possible to obtain stronger robustness results for this class.     

Bayesian Estimation of Entry Games with Multiple Players and Multiple Equilibria

Entry game models are often used to study the nature of firms' profits and the nature of competition among firms in empirical studies. However, when there are multiple players in an oligopoly market, the resulting multiple equilibria have made it difficult in previous studies to estimate the payoff functions of players in complete information, static and discrete games without using unreasonable assumptions. To overcome this difficulty, the present paper proposes a practical estimation method for an entry game with three players using a Bayesian approach. Some mild assumptions are imposed on the payoff function, and the average competitive effect is used to capture the entry effect of the number of firms. Our proposed methodology is applied to Japanese airline data from the year 2000, when there were three major airline companies, ANA, JAL and JAS. The model comparison is conducted to investigate the nature of strategic interaction among these Japanese airline companies.     

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.     

Learning from private information in noisy repeated games

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games where players observe imperfect public signals of the actions played, and both the payoff functions and the map from actions to signal distributions depend on an unknown state. The PTXE payoffs when players are patient are determined by the solutions to a family of linear programming problems. Using this characterization, we develop conditions under which play can be as if the players have learned the state. We provide a sufficient condition for the folk theorem, and a characterization of the PTXE payoffs in games with a known monitoring structure.     

UNIQUENESS OF EQUILIBRIUM PAYOFFS IN FINITELY REPEATED GAMES WITH IMPERFECT MONITORING*

This paper examines when a finitely repeated game with imperfect monitoring has a unique equilibrium payoff vector. This problem is nontrivial under imperfect monitoring, because uniqueness of equilibrium (outcome) in the stage game does not extend to finitely repeated games. A (correlated) equilibrium is equilibrium minimaxing if any player's equilibrium payoff is her minimax value when the other players choose a correlated action profile from the actions played in the equilibrium. The uniqueness result holds if all stage game correlated equilibria are equilibrium minimaxing and have the same payoffs. The uniqueness result does not hold under weaker conditions.     

Learning to play games in extensive form by valuation

Game theoretic models of learning which are based on the strategic form of the game cannot explain learning in games with large extensive form. We study learning in such games by using valuation of moves. A valuation for a player is a numeric assessment of her moves that purports to reflect their desirability. We consider a myopic player, who chooses moves with the highest valuation. Each time the game is played, the player revises her valuation by assigning the payoff obtained in the play to each of the moves she has made. We show for a repeated win-lose game that if the player has a winning strategy in the stage game, there is almost surely a time after which she always wins. When a player has more than two payoffs, a more elaborate learning procedure is required. We consider one that associates with each move the average payoff in the rounds in which this move was made. When all players adopt this learning procedure, with some perturbations, then, with probability 1 there is a time after which strategies that are close to subgame perfect equilibrium are played. A single player who adopts this procedure can guarantee only her individually rational payoff.     

Noisy Directional Learning and the Logit Equilibrium

We specify a dynamic model in which agents adjust their decisions toward higher payoffs, subject to normal error. This process generates a probability distribution of players’ decisions that evolves over time according to the Fokker–Planck equation. The dynamic process is stable for all potential games, a class of payoff structures that includes several widely studied games. In equilibrium, the distributions that determine expected payoffs correspond to the distributions that arise from the logit function applied to those expected payoffs. This “logit equilibrium” forms a stochastic generalization of the Nash equilibrium and provides a possible explanation of anomalous laboratory data.     

Heterogeneous quantal response equilibrium and cognitive hierarchies

We explore an equilibrium model of games where behavior is given by logit response functions, but payoff responsiveness and beliefs about others' responsiveness are heterogeneous. We study two substantively different ways of extending quantal response equilibrium (QRE) to this setting: (1) Heterogeneus QRE, where players share identical correct beliefs about the distribution of payoff responsiveness; and (2) Truncated QRE, where players have downward looking beliefs, systematically underestimating others' responsiveness. We show that the cognitive hierarchy model is a special case of Truncated QRE. We conduct experiments designed to differentiate these approaches. We find significant evidence of payoff responsive stochastic choice, and of heterogeneity and downward looking beliefs in some games.     

Tacit Coordination in a Decentralized Market Entry Game with Fixed Capacity

We focus on a class of market entry games in which a newly emergent market opportunity may be fruitfully exploited by no more than a commonly known, exogenously determined number of firms. Our results show significant effects of the parameters manipulated in the study, namely, the market capacity, entry fee, and method of subject assignment to groups (fixed vs. random). In contrast to previous market entry games with linear payoff functions, we find no evidence of convergence to equilibrium play on the aggregate level. Shifting the focus of the analysis from the aggregate to the individual level, four clusters of subjects are identified. The patterns are: (1) choice of the same action that is independent of the parameters of the game or the outcome of previous presentations of the same game; (2) random choices with probabilities prescribed by the equilibrium solution for risk-neutral players; (3) random choices with probabilities equal to the individual observed overall proportion of entry; and (4) sequential dependencies that violate any model that assumes randomization. Subjects in the fourth and largest category are shown to adjust their choices in accordance with a simple principle of strategic reasoning.     

Equivalence of strong and coalition-proof Nash equilibria in games without spillovers

Summary This paper examines the conditions which guarantee that the set of coalition-proof Nash equilibria coincides with the set of strong Nash equilibria in the normal form games withoutspillovers. We find thatpopulation monotonicity properties of the payoff functions, when the payoff of a player changes monotonically when the size of the group of players choosing the same strategy increases, are crucial to obtain the equivalence of these two solution concepts. We identify the classes of games, satisfying population monotonicity properties, which yield the equivalence of the set of coalition-proof Nash equilibria and the set of strong Nash equilibria. We also provide sufficient conditions for the equivalence result even when the population monotonicity assumptions are relaxed.We wish to thank Mamoru Kaneko, Akihiko Matsui, Tomoichi Shinotsuka, Benyamin Shitoviz, Tayfun Sonmez, William Thomson, the participants of the Southeastern Economic Theory Meeting in Charlottesville and the seminars at CORE and University of Tsukuba for useful discussions and comments. Our special thanks due anonymous referee for the suggestion to add a section addressing the issue of existence of a strong Nash equilibrium.     

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 .     

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.     

Equilibria in large games with continuous procedures

We study existence of equilibria in large games where players use boundedly rational procedures. The equilibria are different from Nash equilibria; the difference persists even when players use procedures for which the observations gathered in any period are used to evaluate the payoff from different actions.     

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.     

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.     

Finitely repeated games with monitoring options

We study finitely repeated games where players can decide whether to monitor the other players? actions or not every period. Monitoring is assumed to be costless and private. We compare our model with the standard one where the players automatically monitor each other. Since monitoring other players never hurts, any equilibrium payoff vector of a standard finitely repeated game is an equilibrium payoff vector of the same game with monitoring options. We show that some finitely repeated games with monitoring options have sequential equilibrium outcomes which cannot be sustained under the standard model, even if the stage game has a unique Nash equilibrium. We also present sufficient conditions for a folk theorem, when the players have a long horizon.     

The single deviation property in games with discontinuous payoffs

We study equilibrium existence in normal form games in which it is possible to associate with each nonequilibrium point an open neighborhood, a set of players, and a collection of deviation strategies, such that at any nonequilibrium point of the neighborhood, a player from the set can increase her payoff by switching to the deviation strategy designated for her. An equilibrium existence theorem for compact, quasiconcave games with two players is established as an application of a general equilibrium existence result for qualitative games. A new form of the better-reply security condition, called the strong single deviation property, is proposed.     

Payoff dominance and risk dominance in the observable delay game: a note

We examine whether the payoff dominant sequential-move (Stackelberg) outcome is realized when timing is endogenized. We adopt the observable delay game formulated by Hamilton and Slutsky [Games Econ Behav 2(1):29–46, 1990]. We find that if one sequential-move outcome is payoff dominant, either (i) the outcome both players prefer is the unique equilibrium; or (ii) two sequential-move outcomes are equilibria and the one both players prefer is risk dominant. In other words, no conflict between payoff dominance and risk dominance in the observable delay game exists, in contrast to other games such as (non pure) coordination games. We also find that even if one of two sequential-move outcomes is the unique equilibrium outcome in the observable delay game, it does not imply that the equilibrium outcome is payoff dominant to the other sequential-move outcome.      

Equilibrium Selection and Consistency

In this paper we show that, for two important classes of strategic games, namely the class of mixed extensions of finite games and the class of games with compact and convex strategy spaces and continuous-concave payoff functions, equilibrium selection is incompatible with One Person Rationality, Consistency and (restricted) Non-Emptiness.