Equilibria in a class of aggregative location games

Consider a multimarket oligopoly, where firms have a single license that allows them to supply exactly one market out of a given set of markets. How does the restriction to supply only one market influence the existence of equilibria in the game? To answer this question, we study a general class of aggregative location games where a strategy of a player is to choose simultaneously both a location out of a finite set and a non-negative quantity out of a compact interval. The utility of each player is assumed to depend solely on the chosen location, the chosen quantity, and the aggregated quantity of all other players on the chosen location. We show that each game in this class possesses a pure Nash equilibrium whenever the players’ utility functions satisfy the assumptions negative externality, decreasing marginal utility, continuity, and Location–Symmetry. We also provide examples exhibiting that, if one of the assumptions is violated, a pure Nash equilibrium may fail to exist.     

Large games with countable characteristics

We consider anonymous games with an atomless probability space of players in which players’ characteristics are countable. Our main result shows that the set of equilibrium distributions coincides with the set of distributions induced by equilibrium strategies together with the function assigning characteristics to players. This result implies the existence of Nash equilibria in continuous large games with countable characteristics.     

Potential games with incomplete preferences

This paper studies potential games allowing the possibility that players have incomplete preferences and empty best-response sets. We define four notions of potential games, ordinal, generalized ordinal, best-response, and generalized best-response potential games, and characterize them using cycle conditions. We study Nash equilibria of potential games and show that the set of Nash equilibria remains the same when every player’s preferences are replaced with the smallest generalized (best-response) potential relation or a completion of it. Similar results are established about strict Nash equilibria of ordinal and best-response potential games. Lastly, we examine the relations among the four notions of potential games as well as pseudo-potential games.     

Strategic behavior in non-atomic games

In order to remedy the possible loss of strategic interaction in non-atomic games with a societal choice, this study proposes a refinement of Nash equilibrium, strategic equilibrium. Given a non-atomic game, its perturbed game is one in which every player believes that he alone has a small, but positive, impact on the societal choice; and a distribution is a strategic equilibrium if it is a limit point of a sequence of Nash equilibrium distributions of games in which each player’s belief about his impact on the societal choice goes to zero. After proving the existence of strategic equilibria, we show that all of them must be Nash. We also show that all regular equilibria of smooth non-atomic games are strategic. Moreover, it is displayed that in many economic applications, the set of strategic equilibria coincides with that of Nash equilibria of large finite games.     

Convergence to competitive equilibria and elimination of no-trade (in a strategic market game with limit prices)

The strategic market games literature contains many results that predict Walrasian equilibria in the competitive limit. However, they usually come at the expense of ad hoc assumptions that rule out “pathological” no trade equilibria. This paper studies a strategic market game with limit prices. The set of Nash equilibrium allocations of this game converges to the set containing all competitive equilibria and no-trade, when players are replicated. Moreover, two rounds of iterated deletion of weakly dominated strategies eliminate the no-trade equilibria. Hence, replication paired with two rounds of iterated dominance gives a clean prediction of competitive equilibrium.     

Determinacy of equilibrium in outcome game forms

We show the generic finiteness of the number of probability distributions on outcomes induced by Nash equilibria for two-person game forms such that either (i) one of the players has no more than two strategies or (ii) both of the players have three strategies, and (iii) for outcome game forms with three players, each with at most two strategies. Finally, we exhibit an example of a game form with three outcomes and three players for which the Nash equilibria of the associated game induce a continuum of payoffs for an open non-empty set of utility profiles.     

Pseudocontinuous functions and existence of Nash equilibria

In topological spaces, we introduce a new class of functions (pseudocontinuous functions) and we present some characterizations and properties. In particular, we show that any preference relation endowed of utility functions is continuous if and only if any utility is pseudocontinuous. A maximum theorem is proved for such a class of functions and connections with similar results are investigated. Finally, the existence of Nash equilibria for games with pseudocontinuous payoffs is obtained.     

Inefficiency and complementarity in sharing games

A sharing game is a very simple device for partially reconciling an organization’s goal with the interests of its members. Each member chooses an action, bears its cost, and receives a share of the revenue which the members’ actions generate. A (pure-strategy) equilibrium of the game may be inefficient: surplus (revenue minus the sum of costs) may be less than maximal. In a previous paper, we found that for a wide class of reward functions, no one squanders at an inefficient equilibrium (spends more than at an efficient profile) if the revenue function has a complementarity property. In the present paper, we examine the “opposite” of the complementarity property (Substitutes) and we study a class of finite games where squandering equilibria indeed occur if Substitutes holds strongly enough. Squandering equilibria play a key role when one traces the effect of technological improvement on a sharing game’s surplus shortfall. We then turn to the question of choice among reward functions in a principal/agents setting. We find that if we again assume complementarity then strong conclusions can be reached about the reward functions preferred by “society”, by the players (agents), and by the principal.     

On pure-strategy Nash equilibria in price–quantity games

This paper examines the existence and characteristics of pure-strategy Nash equilibria in oligopoly models in which firms simultaneously set prices and quantities. Existence of a pure-strategy equilibrium is proved for a class of price–quantity games. If the demand function is continuous, then the equilibrium outcome is similar to that of a price-only model. With discontinuous demand and limited spillover, there are rationing equilibria in which combined production falls short of market demand. Moreover, there might again be an equilibrium reflecting the outcome of a price game. Competition in price and quantity thus yields Bertrand outcomes under a variety of market conditions.     

Non-cooperative games on hyperfinite Loeb spaces

We present a particular class of measure spaces, hyperfinite Loeb spaces, as a model of situations where individual players are strategically negligible, as in large non-anonymous games, or where information is diffused, as in games with imperfect information. We present results on the existence of Nash equilibria in both kinds of games. Our results cover the case when the action sets are taken to be the unit interval, results now known to be false when they are based on more familiar measure spaces such as the Lebesgue unit interval. We also emphasize three criteria for the modelling of such game-theoretic situations—asymptotic implementability, homogeneity and measurability—and argue for games on hyperfinite Loeb spaces on the basis of these criteria. In particular, we show through explicit examples that a sequence of finite games with an increasing number of players or sample points cannot always be represented by a limit game on a Lebesgue space, and even when it can be so represented, the limit of an existing approximate equilibrium may disappear in the limit game. Thus, games on hyperfinite Loeb spaces constitute the ‘right' model even if one is primarily interested in capturing the asymptotic nature of large but finite game-theoretic phenomena.     

Bounds for best response functions in binary games

This paper studies the identification of best response functions in binary games without making strong parametric assumptions about the payoffs. The best response function gives the utility maximizing response to a decision of the other players. This is analogous to the response function in the treatment-response literature, taking the decision of the other players as the treatment, except that the best response function has additional structure implied by the associated utility maximization problem. Further, the relationship between the data and the best response function is not the same as the relationship between the data and the response function in the treatment-response literature. We focus especially on the case of a complete information entry game with two firms. We also discuss the case of an entry game with many firms, non-entry games, and incomplete information. Our analysis of the entry game is based on the observation of realized entry decisions, which we then link to the best response functions under various assumptions including those concerning the level of rationality of the firms, including the assumption of Nash equilibrium play, the symmetry of the payoffs between firms, and whether mixed strategies are admitted.     

Revealed preferences of individual players in sequential games

This paper studies rational choice behavior of a player in sequential games of perfect and complete information without an assumption that the other players who join the same games are rational. The model of individually rational choice is defined through a decomposition of the behavioral norm assumed in the subgame perfect equilibria, and we propose a set of axioms on collective choice behavior that characterize the individual rationality obtained as such. As the choice of subgame perfect equilibrium paths is a special case where all players involved in the choice environment are each individually rational, the paper offers testable characterizations of both individual rationality and collective rationality in sequential games.     

The intrinsic comparative dynamics of locally differentiable feedback Nash equilibria of autonomous and exponentially discounted infinite horizon differential games

The comparative dynamics of locally differentiable feedback Nash equilibria are derived for the ubiquitous class of autonomous and exponentially discounted infinite horizon differential games. The resulting refutable implications are intrinsic to the said class of differential games, and thus form their basic, empirically testable, properties. Their relationship with extant results in the optimal control theory and the static game theory is discussed. Separability conditions are identified on the instantaneous payoff and transition functions under which the intrinsic comparative dynamics collapse, in form, to those in optimal control problems. Applications of the results to capital accumulation and sticky-price games are provided.     

Is having a unique equilibrium robust?

We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium. We show that the set of n  -player finite games with a unique correlated equilibrium is open, while this is not true of Nash equilibrium for n>2$n>2$. The crucial lemma is that a unique correlated equilibrium is a quasi-strict Nash equilibrium. Related results are studied. For instance, we show that generic two-person zero-sum games have a unique correlated equilibrium and that, while the set of symmetric bimatrix games with a unique symmetric Nash equilibrium is not open, the set of symmetric bimatrix games with a unique and quasi-strict symmetric Nash equilibrium is.     

The testable implications of zero-sum games

We study collective choices from the revealed preference theory viewpoint. For every product set of individual actions, joint choices are called Nash-rationalizable if there exists a preference relation for each player such that the selected joint actions are Nash equilibria of the corresponding game. We characterize Nash-rationalizable joint choice behavior by zero-sum games, or games of conflicting interests. If the joint choice behavior forms a product subset, the behavior is called interchangeable. We prove that interchangeability is the only additional empirical condition which distinguishes zero-sum games from general non-cooperative games.     

Communication equilibria with partially verifiable types

This paper studies the set of equilibria that can be achieved by adding general communication systems to Bayesian games in which some information can be certified or, equivalently, in which players’ types are partially verifiable. Certifiability of information is formalized by a set of available reports for each player that varies with the true state of the world. Given these state-dependent sets of reports, we characterize canonical equilibria for which generalized versions of the revelation principle are valid. Communication equilibria and associated canonical representations are obtained as special cases when no information can be certified.     

Full Nash implementation of neutral social functions

This paper characterizes neutral social functions that are fully implementable. A neutral social function must be monotonic and simple to be fully implementable under either the Nash equilibrium concept or the strong Nash equilibrium concept. If a neutral social function is monotonic and simple, then the social function is fully implementable by a set of Nash equilibria. For finite alternative sets a neutral social function will be fully implementable by a set of strong Nash equilibria if and only if it is monotonic, simple and dictatorial.     

Coalitional games with veto players: Consistency, monotonicity and Nash outcomes

Following Dagan et al. [Dagan, N., Volij, O., Serrano, R. (1997). A non-cooperative view on consistent bankruptcy rules, Games Econ. Behav. 18, 55–72], we construct an extensive form game for veto-balanced TU games in which a veto player is the proposer and the other players are responders. The set of Nash outcomes of this extensive form game is described, and compared to solutions of TU games such as the nucleolus, kernel and egalitarian core. We find necessary and sufficient conditions under which the nucleolus of the game is a Nash outcome.     

Coalitional stability in the location problem with single-dipped preferences: An application of the minimax theorem

This study considers a situation in which agents choose the location of a public facility from a street according to a given mechanism. Agents have single-dipped preferences over a set of feasible locations. We analyze coalitional behavior for any given mechanism for this situation. We identify a necessary and sufficient condition for a mechanism to possess a strong Nash equilibrium by applying the minimax theorem of von Neumann and Morgenstern (1944). We introduce a class of core solutions and show that these solutions are characterized by strong Nash implementability. As a byproduct of these results, we propose a simple mechanism that implements any core solution in strong Nash equilibria.     

Essential stability in games with endogenous sharing rules

We prove that essential games with endogenous sharing rules form a dense residual set and that every game with endogenous sharing rules has at least one minimal essential set of solutions. Furthermore, we establish that essential continuous games form a dense residual set and that every continuous game has at least one minimal essential set of Nash equilibria.