We study a double auction environment where buyers and sellers have interdependent valuations and multi-unit demand and supply. We propose a new mechanism that satisfies ex post incentive compatibility, individual rationality, feasibility, nonwastefulness, and no budget deficit. Moreover, this...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

Hatfield and Milgrom (2005) present a unified model of matching with contracts phrased in terms of hospitals and doctors, which subsumes the standard two-sided matching and some package auction models. They show that a stable allocation exists if contracts are substitutes for each hospital. They...

The random priority (random serial dictatorship) mechanism is a common method for assigning objects to individuals. The mechanism is easy to implement and strategy-proof. However this mechanism is inefficient, as the agents may be made all better off by another mechanism that increases their...

Hatfield and Milgrom [Hatfield, John William, Milgrom, Paul R., 2005. Matching with contracts. Amer. Econ. Rev. 95, 913-935] present a unified model of matching with contracts, which includes the standard two-sided matching and some package auction models as special cases. They show that the...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

Stability is a central concept in matching theory, while nonbossiness is important in many allocation problems. We show that these properties are incompatible: there does not exist a matching mechanism that is both stable and nonbossy.

This paper investigates a jury decision when hung juries and retrials are possible. When jurors in subsequent trials know that previous trials resulted in hung juries, informative voting cannot be an equilibrium regardless of voting rules unless the probability that each juror receives the...

The probabilistic serial mechanism (Bogomolnaia and Moulin, 2001 [9]) is ordinally efficient but not strategy-proof. We study incentives in the probabilistic serial mechanism for large assignment problems. We establish that for a fixed set of object types and an agent with a given expected...