Competitive outcomes and the inner core of NTU market games

We consider the inner core as a solution concept for cooperative games with non-transferable utility (NTU) and its relationship to payoffs of competitive equilibria of markets that are induced by NTU games. An NTU game is an NTU market game if there exists a market such that the set of utility allocations a coalition can achieve in the market coincides with the set of utility allocations the coalition can achieve in the game. In this paper, we introduce a new construction of a market based on a closed subset of the inner core which satisfies a strict positive separability. We show that the constructed market represents the NTU game and, further, has the given closed set as the set of payoff vectors of competitive equilibria. It turns out that this market is not uniquely determined, and thus, we obtain a class of markets. Our results generalize those relating to competitive outcomes of NTU market games in the literature.     

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.     

Bertrand price competition with differentiated commodities

This develops a general equilibrium, differentiated commodity version of Bertrand price competition. We study two, related market games in which buyers as well as sellers announce both quantities and prices. In the first game, buyers' strategies are artificially restricted. The Nash allocations of this game will be nearly competitive, provided that the commodities supplied by sellers are sufficiently similar. In the second game, the restriction on buyers' strategies is relaxed and a stronger solution criterion, called local perfection, is invoked. The locally perfect equilibria of the unrestricted game coincide the Nash equilibria of the restricted game.     

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.     

Essential equilibria in normal-form games

A Nash equilibrium x of a normal-form game G is essential if any perturbation of G has an equilibrium close to x. Using payoff perturbations, we show that for games that are generic in the set of compact, quasiconcave, and generalized payoff secure games with upper semicontinuous sum of payoffs, all equilibria are essential. Some variants of this result are also established.     

The supercore for normal-form games

This paper analyzes the supercore of a system derived from a normal-form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore coincides with the set of Nash equilibria of the last game in that sequence. This result is illustrated with the characterization of the supercore for the n-person prisoner's dilemma. With regard to the mixed extension of a normal-form game, we show that the set of Nash equilibrium profiles coincides with the supercore for games with a finite number of Nash equilibria.     

Trading with a common agent under complete information: A characterization of Nash equilibria

We analyze an abstract model of trading where N principals submit quantity-payment schedules that describe the contracts they offer to an agent, and the agent then chooses how much to trade with every principal. This represents a special class of common agency games with complete information. We study all the subgame perfect Nash equilibria of these games, not only truthful ones, providing a complete characterization of equilibrium payoffs. In particular, we show that the equilibrium that is Pareto-dominant for the principals is not truthful when there are more than two of them. We also provide a partial characterization of equilibrium strategies.     

Sequential equilibrium in monotone games: A theory-based analysis of experimental data

A monotone game is an extensive-form game with complete information, simultaneous moves and an irreversibility structure on strategies. It captures a variety of situations in which players make partial commitments and allows us to characterize conditions under which equilibria result in socially desirable outcomes. However, since the game has many equilibrium outcomes, the theory lacks predictive power. To produce stronger predictions, one can restrict attention to the set of sequential equilibria, or Markov equilibria, or symmetric equilibria, or pure-strategy equilibria. This paper explores the relationship between equilibrium behavior in a class of monotone games, namely voluntary contribution games, and the behavior of human subjects in an experimental setting. Several key features of the symmetric Markov perfect equilibrium (SMPE) are consistent with the data. To judge how well the SMPE fits the data, we estimate a model of Quantal Response Equilibrium (QRE) [R. McKelvey, T. Palfrey, Quantal response equilibria for normal form games, Games Econ. Behav. 10 (1995) 6-38; R. McKelvey, T. Palfrey, Quantal response equilibria for extensive form games, Exp. Econ. 1 (1998) 9-41] and find that the decision rules of the QRE model are qualitatively very similar to the empirical choice probabilities.     

A three way equivalence

In view of the well known core equivalence results in atomless economies, coincidence of market game equilibrium allocations with competitive allocations is tantamount to a three way equivalence between market game mechanisms, competitive equilibria and the core. Based on this idea we study equilibrium refinements of market games, which allow us to use the core equivalence machinery in order to provide an exact market game characterization of competitive equilibria.     

Star-shapedness of Richter-Aumann integral on a measure space with atoms: theory and economic applications

This paper provides sufficient (as well as necessary) conditions for the integral of a correspondence defined on a measure space with atoms to exhibit star-shaped values. This result is used to analyze the existence of a Nash equilibrium in games with a measure space of agents with atoms and of a competitive equilibrium in economies with mixed markets. In either case it is shown that an exact equilibrium exists whenever atoms are “small enough”.     

Testing the TASP: An experimental investigation of learning in games with unstable equilibria

We report experiments studying mixed strategy Nash equilibria that are theoretically stable or unstable under learning. The Time Average Shapley Polygon (TASP) predicts behavior in the unstable case. We study two versions of Rock-Paper-Scissors that include a fourth strategy, Dumb. The unique Nash equilibrium is identical in the two games, but the predicted frequency of Dumb is much higher in the game where the NE is stable. Consistent with TASP, the observed frequency of Dumb is lower and play is further from Nash in the high payoff unstable treatment. However, Dumb is played too frequently in all treatments.     

Stable games and their dynamics

We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the payoffs of strategies which revising agents are abandoning. We prove that the set of Nash equilibria of a stable game is globally asymptotically stable under a wide range of evolutionary dynamics. Convergence results for stable games are not as general as those for potential games: in addition to monotonicity of the dynamics, integrability of the agents' revision protocols plays a key role.     

Learning in games with unstable equilibria

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and so place greater weight on recent experience, the time average of play often converges in these “unstable” games, even while mixed strategies and beliefs continue to cycle. This time average, the TASP, is related to the cycle identified by Shapley [L.S. Shapley, Some topics in two person games, in: M. Dresher, et al. (Eds.), Advances in Game Theory, Princeton University Press, Princeton, 1964]. The TASP can be close to or quite distinct from Nash equilibrium.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

ENDOGENOUS TIMING IN QUALITY CHOICES AND PRICE COMPETITION

We modify the price‐setting version of the vertically differentiated duopoly model by Aoki (2003) by introducing an extended game in which firms noncooperatively choose the timing of moves at the quality stage. Our results show that there are multiple equilibria in pure strategies, whereby firms always select sequential play at the quality stage. We also investigate the mixed‐strategy equilibrium, revealing that the probability of generating outcomes out of equilibrium is higher than the probability of playing one Nash equilibria in pure strategies. In the alternative case with full market coverage, we show that the quality stage is solved in dominant strategies and therefore the choice of roles becomes irrelevant as the Nash and Stackelberg solutions coincide. With full market coverage and corner solution, the results show that the game has a unique subgame perfect equilibrium in pure strategies, where the high‐quality firm takes the lead in the quality stage.     

Incomplete information and singleton cores in matching markets

We study ordinal Bayesian Nash equilibria of stable mechanisms in centralized matching markets under incomplete information. We show that truth-telling is an ordinal Bayesian Nash equilibrium of the revelation game induced by a common belief and a stable mechanism if and only if all the profiles in the support of the common belief have singleton cores. Our result matches the observations of Roth and Peranson [The redesign of the matching market for American physicians: some engineering aspects of economic design, Amer. Econ. Rev. 89 (1999) 748-780] in the National Resident Matching Program (NRMP) in the United States: (i) the cores of the profiles submitted to the clearinghouse are small and (ii) while truth-telling is not a dominant strategy most participants in the NRMP truthfully reveal their preferences.     

Competitive environments and protective behavior

The class of two-person competition games is introduced and analyzed. For any game in this class the set of Nash equilibria is convex and all Nash equilibria lead to the same payoff vector. Competition games are compared to other competitive environments such as unilaterally competitive games and rivalry games. Moreover, protective behavior within competitive environments is analyzed. For matrix games it is known that protective strategies profiles exactly correspond to proper equilibria. It is shown that this result can be extended to the class of unilaterally competitive games.     

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.     

Knightian games and robustness to ambiguity

This paper introduces a notion of robustness to ambiguous beliefs for Bayesian Nash equilibria. An equilibrium is robust if the corresponding strategies remain approximately optimal for a class of games with ambiguous beliefs that results from an appropriately defined perturbation of the belief structure of the original non-ambiguous belief game. The robustness definition is based on a novel definition of equilibrium for games with ambiguous beliefs that requires equilibrium strategies to be approximate best responses for all measures that define a player's belief. Conditions are derived under which robustness is characterized by a newly defined strategic continuity property, which can be verified without reference to perturbations and corresponding ambiguous belief games.     

On Stackelberg competition in strategic multilateral exchange

In this paper, we consider a strategic equilibrium concept which extends Stackelberg competition to cover a general equilibrium framework. From the benchmark of strategic market games proposed by Sahi and Yao (1989), we define the notion of Stackelberg equilibrium. This concept captures strategic interactions in interrelated markets on which a finite number of leaders and followers compete on quantities. Within the framework of an example, convergence and welfare are studied. More specifically, we analyze convergence toward the competitive equilibrium and make welfare comparisons with other strategic equilibria.