The absence of simultaneous cycles is a sufficient condition for the existence of singleton cores. Acyclicity in the preferences of either side of the market is a minimal condition that guarantees the existence of singleton cores.

A new axiom, symmetry-based compromise, is introduced to study solutions to convex bargaining problems. It is shown that any efficient solution that is also scale invariant and satisfies symmetry-based compromise must be Nash.

In the problem of allocating workers to different projects, where each project needs a minimum number of workers assigned to it, the serial dictatorship mechanism is neither strategy proof nor Pareto efficient. We therefore propose a strategy-proof and Pareto-efficient mechanism.

We establish a link between cooperative and competitive behavior. For every possible vector of weights of an asymmetric Nash bargaining solution there exists a market that has this asymmetric Nash bargaining solution as its unique competitive payoff vector.

In this paper, virtual implementation is restricted to deliver, on the equilibrium path, either a socially optimal outcome or a status quo: an outcome fixed for all preference profiles. Under such a restriction, for any unanimous and implementable social choice function there is a dictator, who...

We examine a housing market with price controls and show how the allocation problem can be solved through a price system. We demonstrate that the auction of Talman and Yang (2008) always generates a core allocation, thus resulting in a Pareto efficient and stable outcome.