By viewing negotiation problems as problems of fair division, one can apply intuitive procedures to a variety of complex conflicts. This, however, requires the negotiated issues to be interpreted as items to be divided among the parties involved. In this paper, we go in the opposite direction...

Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by de.ning a social choice correspondence that is based on the solution rather than on its...

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 (1997) for any two-person bargaining game (S, d) an extensive form game G^{S,d} is defined that has an infinity of weakly...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed. We offer two characterizations of the prominent lottery assignment mechanism called the probabilistic serial. We show that it is the only mechanism satisfying...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso-Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firms' reports following Milgrom (2010). We show...