Strategy-proof allocation of a finite number of indivisible goods among a finite number of individuals is considered. The main result is that in a pure distributional case, a mechanism is strategy-proof, nonbossy and neutral if and only if it is serially dictatorial. If the indivisible goods are...

This paper provides two axiomatizations of the probabilistic serial mechanism. First, the mechanism is characterized by ordinal efficiency, envy-freeness, and truncation robustness. Truncation robustness restricts changes in assignments when agents truncate their preference lists. In this...

Allocation and exchange of discrete resources such as kidneys, school seats, and many other resources for which agents have single-unit demand is conducted via direct mechanisms without monetary transfers. Incentive compatibility and efficiency are primary concerns in designing such mechanisms....

This paper studies economies where agents exchange indivisible goods and money. Agents have potential use for all indivisible goods and the indivisible goods are differentiated. We assume that agents have quasi-linear utilities in money, have sufficient money endowments to afford any group of...

We consider allocation mechanisms in economies with a single indivisible good and money. First, we show that there is no strategy-proof and Pareto efficient mechanism on some preference domains which consist of a sufficiently large but finite number of quasi-linear preferences. Second, we show...

Consider a market for a resource under disequilibrium prices where suppliers and demanders are privately informed about their optimal supply and consumption levels. Strategy-proof market clearing mechanisms give suppliers and demanders dominant strategy incentives to truthfully reveal this...

One set of n objects of type I, another set of n objects of type II, and an amount M of money is to be completely allocated among n agents in such a way that each agent gets one object of each type with some amount of money. We propose a new solution concept to this problem called a perfectly...