A fair division problem with indivisible objects, e.g. jobs, and one divisible good (money) is considered. The individuals consume one object and money. The class of strategy-proof and fair allocation rules is characterized. The allocation rules in the class are like a Vickrey auction bossy and...

This paper considers a house allocation problem with no initial ownership and where prices are bounded from below and above by exogenously given price restrictions. This type of housing market contains, e.g., the "assignment market" and the "student placement problem" as special cases. A...

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...

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of...

In a linear production model, we characterize the class of efficient and strategy-proof allocation functions, and the class of efficient and coalition strategy-proof allocation functions. In the former class, requiring equal treatment of equals allows us to identify a unique allocation function....

Which strategy-proof nonbossy mechanisms exist in a model with a finite number of indivisible goods (houses, jobs, positions) and a compensating perfectly divisible good (money)? The main finding is that only a finite number of distributions of the divisible good is consistent with...

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

We analyze coalition formation problems in which a group of agents is partitioned into coalitions and agents' preferences only depend on the coalition they belong to. We study rules that associate to each profile of agents' preferences a partition of the society. We focus on strategy-proof rules...

This paper investigates the problem of allocating two types of indivisible objects among a group of agents when a priority-order must be respected and when only restricted monetary transfers are allowed. Since the existence of a fair allocation not generally is guaranteed due the the...

A fair division problem with indivisible objects, e.g. jobs, and one divisible good (money) is considered. The individuals consume one object and money. The class of strategy-proof and fair allocation rules is characterized. The allocation rules in the class are like a Vickrey auction bossy and...