Co-ordination, Spillovers, and Cheap Talk

We analyze the role of cheap-talk in two player games with one-sided incomplete information. We identify conditions under which (1) players can fully communicate and coordinate on efficient Nash equilibria of the underlying complete information game; and (2) players cannot communicate so cheap-talk does not alter the equilibrium set of the Bayesian game. We present examples that illustrate several issues that arise when there is two-sided incomplete information. Journal of Economic Literature Classification Numbers: C72, D82.     

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.     

The Envelope Theorem and Comparative Statics of Nash Equilibria

The Envelope Theorem for Nash equilibria shows that the strategic reaction of the other players in the game is important for determining how parameter perturbations affect a given player's indirect objective function. The fundamental comparative statics matrix of Nash equilibria for theithplayer in anN-player static game includes the equilibrium response of the otherN−1players in the game to the parameter perturbation and is symmetric positive semidefinite subject to constraint. This result is fundamental in that it holds for all sufficiently smooth Nash equilibria and is independent of any curvature or stability assumptions imposed on the game.Journal of Economic LiteratureClassification Numbers: C72, C61.     

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.     

Nash equilibria in ∞-dimensional spaces: an approximation theorem

Summary. We show, by employing a density result for probability measures, that in games with a finite number of players and ∞-dimensional pure strategy spaces Nash equilibria can be approximated by finite mixed strategies. Given ε>0, each player receives an expected utility payoff ε/2 close to his Nash payoff and no player could change his strategy unilaterally and do better than ε. Received: July 15, 1997; revised version: February 6, 1998     

EQUILIBRIA IN NON-COOPERATIVE GAMES II: DEVIATIONS BASED REFINEMENTS OF NASH EQUILIBRIUM

In any Nash equilibrium no player will unilaterally deviate. However, many games have multiple Nash equilibria. In this paper, we survey some refinements of Nash equilibria based on the hypothesis that any player may consider a deliberate deviation from a Nash equilibrium vector while expecting other players to respond optimally to this deviation. The concepts studied here differ in the expectations players have about other players' responses to a deviation. This sort of deviations philosophy is predicated on the thought process of players. Therefore, the validity of a particular equilibrium concept to an economic model may depend upon the relevance of the thought process implied by the concept.     

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.     

Walrasian analysis via two-player games

We associate to any pure exchange economy a game with only two players, regardless of the number of consumers. In this two-player game, each player represents a different role of the society, formed by all the individuals in the economy. Player 1 selects feasible allocations trying to make Pareto improvements. Player 2 chooses an alternative from the wider range of allocations that are feasible in the sense of Aubin. The set of Nash equilibria of our game is non-empty and our main result provides a characterization of Walrasian equilibria allocations as strong Nash equilibria of the associated society game.     

Partial exposure in large games

In this work we introduce the notion of partial exposure, in which the players of a simultaneous-move Bayesian game are exposed to the realized types and chosen actions of a subset of the other players. We show that in any large simultaneous-move game, each player has very little regret even after being partially exposed to other players. If players are given the opportunity to be exposed to others at the expense of a small decrease in utility, players will decline this opportunity, and the original Nash equilibria of the game will survive.     

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     

Determinacy of equilibrium outcome distributions for zero sum and common utility games

We show the generic finiteness of probability distributions induced on outcomes by the Nash equilibria in two player zero sum and common interest outcome games.     

Competitive behavior in market games: Evidence and theory

We explore whether competitive outcomes arise in an experimental implementation of a market game, introduced by Shubik (1973) [21]. Market games obtain Pareto inferior (strict) Nash equilibria, in which some or possibly all markets are closed. We find that subjects do not coordinate on autarkic Nash equilibria, but favor more efficient Nash equilibria in which all markets are open. As the number of subjects participating in the market game increases, the Nash equilibrium they achieve approximates the associated competitive equilibrium of the underlying economy. Motivated by these findings, we provide a theoretical argument for why evolutionary forces can lead to competitive outcomes in market games.     

Learning by matching patterns

We analyze a model of repeated play between two boundedly rational agents. In each stage each player recalls the outcomes from the most recent few rounds, calculates the distribution of its opponent's past reactions to this outcome pattern, and then optimizes myopically against this distribution. If both players use the same pattern length then the limit points of pattern matching are in the convex hull of the limit points of fictitious play. Thus if fictitious play converges into the set of Nash equilibria then pattern matching converges into the convex hull of Nash equilibria. If the players use different pattern lengths, the more sophisticated player may, but does not generally, succeed in playing as if it could perfectly predict its opponent's play.     

Heterogeneous network games: Conflicting preferences

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thresholds for switching action that relate to the two-player setup of the games. This structure of equilibria is considerably reduced when turning to incomplete information, in a setup in which players only know the distribution of the number of neighbors of the network. For high degrees of heterogeneity in the population the equilibria is such that every player can choose her preferred action, whereas if one of the identities is in the minority frustration ensues.     

On the convergence to the Nash bargaining solution for action-dependent bargaining protocols

We consider a non-cooperative multilateral bargaining game and study an action-dependent bargaining protocol, that is, the probability with which a player becomes the proposer in a round of bargaining depends on the identity of the player who previously rejected. An important example is the frequently studied rejector-becomes-proposer protocol. We focus on subgame perfect equilibria in stationary strategies which are shown to exist and to be efficient. Equilibrium proposals do not depend on the probability to propose conditional on the rejection by another player. We consider the limit, as the bargaining friction vanishes. In case no player has a positive probability to propose conditional on his rejection, each player receives his utopia payoff conditional on being recognized. Otherwise, equilibrium proposals of all players converge to a weighted Nash bargaining solution, where the weights are determined by the probability to propose conditional on one's own rejection.     

Asymptotic expected number of Nash equilibria of two-player normal form games

The formula given by McLennan [The mean number of real roots of a multihomogeneous system of polynomial equations, Amer. J. Math. 124 (2002) 49–73] is applied to the mean number of Nash equilibria of random two-player normal form games in which the two players have M and N pure strategies respectively. Holding M fixed while N→∞, the expected number of Nash equilibria is approximately . Letting M=N→∞, the expected number of Nash equilibria is , where is a constant, and almost all equilibria have each player assigning positive probability to approximately 31.5915 percent of her pure strategies.     

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.     

Endogenous private information structures

We formally incorporate the option to gather information into a game and thus endogenize the information structure. We ask whether models with exogenous information structures are robust with respect to this endogenization. Any Nash equilibrium of the game with information acquisition induces a Nash equilibrium in the corresponding game with an exogenous structure. We provide sufficient conditions on the structure of the game for which this remains true when ‘Nash’ is replaced by ‘sequential’. We characterize the (sequential) Nash equilibria of games with exogenous information structures that can arise as a (sequential) Nash equilibrium of games with endogenous information acquisition.     

Directed Networks with Spillovers

We study noncooperative network formation in two types of directed networks. In the first type, called the model with global spillovers, the payoff of a player depends on the number of links she forms as well as the total number of links formed by all other players. In the second type, called the model with local spillovers, the payoff of a player depends on the number of links she forms and the total number of links formed by her immediate neighbors, as well as the number of links formed by players outside her neighborhood. For both classes of games we investigate the existence of pure strategy Nash equilibria and characterize the Nash networks under a number of different second order conditions on the payoff function.     

Gradualism and Irreversibility

This paper considers a class of two–player dynamic games in which each player controls a one–dimensional action variable, interpreted as a level of cooperation. The dynamics are due to an irreversibility constraint: neither player can ever reduce his cooperation level. Payoffs are decreasing in one&'s own action, increasing in one&'s opponent&'s action. We characterize efficient symmetric equilibrium action paths; actions rise gradually over time and converge, when payoffs are smooth, to a level strictly below the one–shot efficient level, no matter how little discounting takes place. The analysis is extended to incorporate sequential moves and asymmetric equilibria.