Uniqueness of stationary equilibria in bargaining one-dimensional policies under (super) majority rules

We consider negotiations selecting one-dimensional policies. Individuals have instantaneous preferences represented by continuous, concave and single-peaked utility functions, and they are impatient. Decisions arise from a bargaining game with random proposers and (super) majority approval, ranging from the simple majority up to unanimity. We provide sufficient conditions that guarantee the existence of a unique stationary subgame perfect equilibrium, and we provide its explicit characterization. The uniqueness of the equilibrium permits an analysis of the set of Pareto optimal voting rules. For symmetric distributions of peaks and uniform recognition probabilities unanimity is the unanimously preferred majority rule.     

Uniqueness of stationary equilibrium payoffs in coalitional bargaining

We study a model of sequential bargaining in which, in each period before an agreement is reached, the proposer?s identity is randomly determined, the proposer suggests a division of a pie of size one, each other agent either approves or rejects the proposal, and the proposal is implemented if the set of approving agents is a winning coalition for the proposer. The theory of the fixed point index is used to show that stationary equilibrium expected payoffs of this coalitional bargaining game are unique. This generalizes Eraslan [34] insofar as: (a) there are no restrictions on the structure of sets of winning coalitions; (b) different proposers may have different sets of winning coalitions; (c) there may be a positive probability that no proposer is selected.     

Proposal power and majority rule in multilateral bargaining with costly recognition

This paper studies a sequential bargaining model in which agents expend efforts to be the proposer. In equilibrium, agents’ effort choices are influenced by the prize and cost effects. The (endogenous) prize is the difference between the residual surplus an agent obtains when he is the proposer and the payment he expects to receive when he is not. Main results include: (1) under the unanimity voting rule, two agents with equal marginal costs propose with equal probabilities, regardless of their time preferences; (2) under a nonunanimity rule, however, the more patient agent proposes with a greater probability; (3) while, under the unanimity rule, the social cost decreases in group heterogeneity, it can increase under a nonunanimity rule; and (4) when agents are identical, the unanimity rule is socially optimal.     

Political bargaining in a federation: Buchanan meets Coase

In recent decades, the issues of federalism and political integration have gained prominence in public debate as well as in the academic realm. A frequently made point is that allowing free secession may protect the minority's interests, thus providing it with an incentive to enter the federation. This paper explicitly considers the political process in the federation arguing that the option to secede may distort the political choices made by the individual regions to improve their bargaining positions. As a result, the allocation of resources in the federation could well end up being inefficient and unattractive for the minority region. In contrast, limiting the secession possibilities by requiring the consent of a majority of voters through a regional referendum, rather than leaving it to the discretion of the legislature, restores efficiency.     

Correlated equilibria and local interactions

Summary This paper shows that Nash equilibria of a local-interaction game are equivalent to correlated equilibria of the underlying game.This work was done while George Mailath and Larry Samuelson were visiting the University of Bonn, whose hospitality is gratefully acknowledged. We thank Ken Binmore for helpful discussions. This is a revision of Section 2 of Mailath, Samuelson, and Shaked [6]. Financial support from the National Science Foundation and the Deutsche Forschungsgemeinschaft, Sonderforschungsbereich 303 at the University of Bonn, is gratefully acknowledged.     

Multiple equilibria in Tullock contests

We find the sufficient conditions for the existence of multiple equilibria in Tullock-type contests, and show that asymmetric equilibria arise even under symmetric prize and cost structures. We then present existing contests where multiple equilibria exist under reasonably weak conditions.     

A three-player dynamic majoritarian bargaining game

We analyze an infinitely repeated divide-the-dollar bargaining game with an endogenous reversion point. In each period a new dollar is divided among three legislators according to the proposal of a randomly recognized member—if a majority prefer so—or according to previous period's allocation otherwise. Although current existence theorems for Markovian equilibria do not apply for this dynamic game, we fully characterize a Markov equilibrium. The equilibrium is such that irrespective of the discount factor or the initial division of the dollar, the proposer eventually extracts the whole dollar in all periods. We also show that proposal strategies are weakly continuous in the status quo that equilibrium expected utility is not quasi-concave, and the correspondence of voters’ acceptance set (the set of allocations weakly preferred over the status quo) fails lower hemicontinuity.     

Uniqueness of the index for Nash equilibria of two-player games

Summary. Given a map whose roots are the Nash equilibria of a game, each component of the equilibrium set has an associated index, defined as the local degree of the map. This note shows that for a two-player game, every map with the same roots induces the same index. Moreover, this index agrees with the Shapley index constructed from the Lemke-Howson algorithm. Received: May 30, 1996; revised version June 25, 1996     

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.     

Nominal bargaining power, selection protocol, and discounting in legislative bargaining

The comparative static predictions of the Baron and Ferejohn [Baron, D.P., and Ferejohn, J.A., (1989). Bargaining in legislatures, American Political Science Review 83 (4), 1181-1206] model better organize behavior in legislative bargaining experiments than Gamson's Law. Regressions similar to those employed in field data produce results seemingly in support of Gamson's Law (even when using data generated by simulating agents who behave according to the Baron-Ferejohn model), but this is determined by the selection protocol which recognizes voting blocks in proportion to the number of votes controlled. Proposer power is not nearly as strong as predicted in the closed rule Baron and Ferejohn model, as coalition partners refuse to take the small shares given by the continuation value of the game. Discounting pushes behavior in the direction predicted by Baron and Ferejohn but has a much smaller effect than predicted.     

All equilibria of the Vickrey auction

This paper characterizes the set of Nash equilibria in the second-price sealed-bid auction with independent private values and three or more bidders. In addition, we show that any effective reserve price implies uniqueness.     

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.     

Local coordination and market equilibria

We reformulate the local stability analysis of market equilibria in a competitive market as a local coordination problem in a market game, where the map associating market prices to best-responses of all traders is common knowledge and well-defined both in and out of equilibrium. Initial expectations over market variables differ from their equilibrium values and are not common knowledge. This results in a coordination problem as traders use the structure of the market game to converge back to equilibrium. We analyse a simultaneous move and a sequential move version of the market game and explore the link with local rationalizability.     

Generalized potentials and robust sets of equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions. These sufficient conditions unify and generalize existing sufficient conditions. Our generalization of potential games is useful in other game theoretic problems where potential methods have been applied.     

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.     

Bargaining one-dimensional social choices

We analyze bargaining over the one-dimension characteristic of a public good among n impatient players when decisions require q favorable votes, q?2. Stationary subgame perfect equilibrium strategies are characterized for all games with deterministic protocol. We provide a monotonicity condition (satisfied by all single-peak, strictly quasi-concave and concave utilities) that assures uniqueness for every q whenever player's utilities are symmetric around the peak. Without symmetry, the monotonicity condition assures uniqueness for qualified majorities, q>n/2, provided that agents are sufficiently patient and utilities satisfy an additional regularity condition. Asymptotic uniqueness is assured for qualified majorities by imposing only the monotonicity condition.     

Non-Walrasian equilibria and the law of one price

We present a market game which features multiple posts for each commodity. We use this framework to illustrate the idea that in non-Walrasian markets, where individual activities influence market clearing prices, there are equilibria where commodities are exchanged simultaneously in two posts at different prices, thus defying the ‘law of one price’. Such equilibria are compatible with an apparent arbitrage possibility, which dissipates whenever individuals try to take advantage of it.     

Optimal mechanism design with resale via bargaining

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully characterize an optimal mechanism under general conditions. Surprisingly, in this optimal mechanism, the seller never allocates the object to the regular buyer regardless of his bargaining power in the resale market. The seller sells only to the publicly known buyer, and reveals no additional information to the resale market. The possibility of resale causes the seller to sometimes hold back the object, which under our setup is never optimal if resale is prohibited. We find that the seller?s revenue is increasing in the publicly known buyer?s bargaining power in the resale market. When the publicly known buyer has full bargaining power, Myerson?s optimal revenue is achieved; when the publicly known buyer has no bargaining power, a conditionally efficient mechanism prevails.     

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.     

Simple Markovian equilibria in dynamic spatial legislative bargaining

The paper proves, by construction, the existence of Markovian equilibria in a dynamic spatial legislative bargaining model. Players bargain over policies in an infinite horizon. In each period, a sequential protocol of proposal-making and voting, with random proposer recognitions and a simple majority, produces a policy that becomes the next period's status-quo; the status-quo is endogenous. The construction relies on simple strategies determined by strategic bliss points computed by the algorithm we provide. A strategic bliss point, the dynamic utility ideal, is a moderate policy relative to a bliss point, the static utility ideal. Moderation is strategic and germane to the dynamic environment; players moderate in order to constrain the future proposals of opponents. Moderation is a strategic substitute; when a player's opponents do moderate, she does not, and when they do not moderate, she does. We provide conditions under which the simple strategies induced by the strategic bliss points computed by the algorithm deliver a Stationary Markov Perfect equilibrium, and we prove its existence in generic games with impatient players and in symmetric games. Because the algorithm constructs all equilibria in simple strategies, we provide their general characterization, and we show their generic uniqueness.