Delay,multiplicity, and non-existence of equilibrium in unanimity bargaining games

We consider a class of perfect information bargaining games with unanimity acceptance rule. The proposer and the order of responding players are determined by the state that evolves stochastically over time. The probability distribution of the state in the next period is determined jointly by the current state and the identity of the player who rejected the current proposal. This protocol encompasses a vast number of special cases studied in the literature. We show that subgame perfect equilibria in pure stationary strategies need not exist. When such equilibria do exist, they may exhibit delay. Limit equilibria as the players become infinitely patient need not be unique.     

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.     

An exact non-cooperative support for the sequential Raiffa solution

This article provides an exact non-cooperative foundation of the sequential Raiffa solution for two-person bargaining games. Based on an approximate foundation due to Myerson (1991) for any two-person bargaining game (S, d) an extensive form game G^S,d is defined that has an infinity of weakly subgame perfect equilibria whose payoff vectors coincide with that of the sequential Raiffa solution of (S, d). Moreover all those equilibria share the same equilibrium path consisting of proposing the Raiffa solution and accepting it in the first stage of the game.By a modification of G^S,d the analogous result is provided for subgame perfect equilibria. These results immediately extend to implementation of a sequential Raiffa (solution based) social choice rule in subgame perfect equilibrium.     

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.     

Cournot outcomes under Bertrand–Edgeworth competition with demand uncertainty

We provide new results for two-stage games in which firms make capacity investments when demand is uncertain, then, when demand is realized, compete in prices. We consider games with demand rationing schemes ranging from efficient to proportional rationing. In all cases, there is a subgame perfect equilibrium outcome coinciding with the outcome of the Cournot game with demand uncertainty if and only if (i) the fluctuation in absolute market size is small relative to the cost of capacity, or (ii) uncertainty is such that with high probability the market demand is very large and with the remaining probability the market demand is extremely small. Otherwise, equilibria involve mixed strategies. Further, we show under efficient rationing that condition (i) is sufficient for the unique equilibrium outcome to be an equilibrium outcome of the Cournot game with demand uncertainty.     

Odd man out: the proposal-making model

The proposal-making model is applied to the class of three-player/three-cake problems. The set of subgame perfect equilibria (SPEs) and the limit set of SPE payoffs as the risk of breakdown vanishes is characterized. The necessary and sufficient condition for uniqueness is derived. The results for the alternating offer model play an important role. The model always admits one stationary SPE and this equilibrium is related to a multilateral Nash solution. The stationary SPE is the coalition-proof SPE and the limit result differs from the result known for the model without risk of breakdown.     

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.     

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.     

Large but finite games with asymmetric information

Carmona considered an increasing sequence of finite games in each of which players are characterized by payoff functions that are restricted to vary within a uniformly equicontinuous set and choose their strategies from a common compact metric strategy set. Then Carmona proved that each finite game in an upper tail of such a sequence admits an approximate Nash equilibrium in pure strategies.     

On essential, (strictly) perfect equilibria

It is known that generic games within certain collections of infinite-action normal-form games have only essential equilibria. We point to a difficulty in showing that essential equilibria in generic games are (strictly) perfect, and we identify collections of games whose generic members have only essential and (strictly) perfect equilibria.     

Trade through endogenous intermediaries

We propose an intermediation core for an economy that explicitly specifies how traders organize themselves into trade cooperatives (intermediaries) and how trade between them gets carried out. The intermediation core allocations are closely related to the equilibrium allocations of a non-cooperative intermediation game in Townsend (1983). We show that the intermediation core contains all subgame perfect equilibrium allocations of the intermediation game, similar to the inclusion of competitive equilibrium allocations in the core usually studied. We identify intermediation core allocations that are also subgame perfect equilibrium allocations of the intermediation game in terms of the supporting intermediary structures. These results help to characterize subgame perfect equilibrium allocations of the intermediation game and to analyze their welfare and stability properties.     

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.     

Multi-lateral strategic bargaining without stationarity

This paper establishes existence of subgame perfect equilibrium in pure strategies for a general class of sequential multi-lateral bargaining games, without assuming a stationary setting. The only required hypothesis is that utility functions are continuous on the space of economic outcomes. In particular, no assumption on the space of feasible payoffs is needed. The result covers arbitrary and even time-varying bargaining protocols (acceptance rules), externalities, and other-regarding preferences. As a side result, we clarify the meaning of assumptions on “continuity at infinity.”     

Strong Nash equilibrium in games with common and complementary local utilities

A rather general class of strategic games is described where the coalitional improvements are acyclic and hence strong Nash equilibria exist: The players derive their utilities from the use of certain facilities; all players using a facility extract the same amount of local utility therefrom, which amount depends both on the set of users and on their actions, and is decreasing in the set of users; the ultimate utility of each player is the minimum of the local utilities at all relevant facilities. Two important subclasses are “games with structured utilities,” basic properties of which were discovered in 1970s and 1980s, and “bottleneck congestion games,” which attracted researchers’ attention quite recently. The former games are representative in the sense that every game from the whole class is isomorphic to one of them. The necessity of the minimum aggregation for the existence of strong Nash equilibria, actually, just Pareto optimal Nash equilibria, in all games of this type is established.     

供应链中双方供应的竞争和合作博弈研究

针对当前供应链中供应方面存在的相关局限性。构造了双方供应和制造商之间的博弈模型。该模型主要特点是双方 供应之间的二阶段博弈所形成的质量和价格策略。在此条件下制造商和供应商之间进行讨价还价。以分配整体利润。指出了供 需双方在讨价还价时存在惟一的子博彝精炼纳什均衡。     

Implementation of the recursive core for partition function form games

In partition function form games, the recursive core (r-core) is implemented by a modified version of Perry and Reny’s [Perry, M., Reny, P., 1994. A non-cooperative view of coalition formation and the core. Econometrica 62, 795-817] non-cooperative game. Specifically, every stationary subgame perfect Nash equilibrium (SSPNE) outcome is an r-core outcome. With the additional assumption of total r-balancedness, every r-core outcome is an SSPNE outcome.     

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.     

Spatial social networks

We introduce a spatial cost topology in the network formation model analyzed by Jackson and Wolinsky, Journal of Economic Theory (1996), 71: 44–74. This cost topology might represent geographical, social, or individual differences. It describes variable costs of establishing social network connections. Participants form links based on a cost-benefit analysis. We examine the pairwise stable networks within this spatial environment. Incentives vary enough to show a rich pattern of emerging behavior. We also investigate the subgame perfect implementation of pairwise stable and efficient networks. We construct a multistage extensive form game that describes the formation of links in our spatial environment. Finally, we identify the conditions under which the subgame perfect Nash equilibria of these network formation games are stable. We are very grateful for the constructive comments of Matt Jackson and an anonymous referee. We also like to thank Vince Crawford, Marco Slikker, Edward Droste, Hans Haller, Dimitrios Diamantaras, and Sudipta Sarangi for comments on previous drafts of this paper.We acknowledge Jay Hogan for his programming support. Part of this research was done while visiting the CentER for Economic Research, Tilburg University, Tilburg, The Netherlands.Financial support from the Netherlands Organization for Scientific Resrarch (NWO), grant B46-390, is gratefully acknowledged.-->,     

Subgame-perfect equilibria in stochastic timing games

We develop a notion of subgames and the related notion of subgame-perfect equilibrium – possibly in mixed strategies – for stochastic timing games. To capture all situations that can arise in continuous-time models, it is necessary to consider stopping times as the starting dates of subgames. We generalize Fudenberg and Tirole’s (Rev. Econom. Stud. 52, 383–401, 1985) mixed-strategy extensions to make them applicable to stochastic timing games and thereby provide a sound basis for subgame-perfect equilibria of preemption games. Sufficient conditions for equilibrium existence are presented, and examples illustrate their application as well as the fact that intuitive arguments can break down in the presence of stochastic processes with jumps.     

A note on the symmetry of all Nash equilibria in games with increasing best replies

It is well known that a symmetric game has only symmetric (pure strategy) Nash equilibria if its best-reply correspondences admit only increasing selections and its strategy sets are totally ordered. Several nonexamples of the literature show that this result is generally false when the totality condition of the relation that orders the strategy sets is simply dropped. Making use of the structure of interaction functions, this note provides sufficient conditions for the symmetry of all (pure strategy) Nash equilibria in symmetric games where best-reply correspondences admit only increasing selections, but strategy sets are not necessarily totally ordered.