This paper studies a non-cooperative bargaining problem with one buyer and many sellers, focussing on the tension between the complementarity intrinsic to such a setup and efficiency. We address this problem in a very general setup with a technology that allows for variable degrees of...

This paper characterizes the conditions under which holdout (i.e. bargaining inefficiency) may, or may not be significant in a two-sided, one-buyer-many-seller model with complementarity. We address this problem in a very general setup with a bargaining protocol that is symmetric and allows for...

The Mekong River (MR) is shared by six countries: China, Myanmar, Thailand, Laos, Cambodia, and Vietnam. Over the years there have been both conflict and cooperation on managing the water resources to meet population growth, climate change and the desire for economic development. Currently, the...

This paper derives several simple matching algorithms for special cases of a continuous two sided matching model where agents have single peaked preferences and face no costs or restrictions to matching. These algorithms allow matches to be computed as an explicit function of the parameters of...

When there are three parties, it is well known that the Coase Theorem may not hold even when there are no transaction costs, due to the emptiness of the core of the corresponding cooperative game [Aivazian and Callen (1981)]. We show that the standard Coasean bargaining game involving three...

We study the course allocation system at Nanyang Technological University, where students submit strict preferences for courses and courses have implicit preferences for students. This formulates a many-to-many matching problem. We show the inefficiencies of the current mechanism and propose new...

In U.S. presidential elections, voters in noncompetitive states seem not to count—and so have zero voting power, according to the Banzhaf and other voting-power indices—because they cannot influence the outcome in their states. But because the electoral votes of these states are essential to...

In bargaining problems, a rule satisfies ordinal invariance if it does not depend on order-preserving transformations of the agents' utilities. In this paper, a simple non-cooperative game for three agents, based on bilateral offers, is presented. The ordinal Shapley rule arises in subgame...

Background: To expand the opportunity for paired live donor kidney transplantation, computerized matching algorithms have been designed to identify maximal sets of compatible donor/recipient pairs from a registry of incompatible pairs submitted as candidates for transplantation. Methods:...

Parties in a bargaining situation may perceive guilt, a utility loss caused by receiving the larger share that is modeled in some social preferences. I extend Rubinstein (1982)'s solution of the open-ended alternating-offer bargaining problem for self-interested bargainers to a game with equally...