We study resource allocation with multi-unit demand, such as the allocation of courses to students. In contrast to the case of single-unit demand, no stable mechanism, not even the (student-proposing) deferred acceptance algorithm, achieves desirable properties: it is not strategy-proof and the...

A benevolent Planner wishes to assign an indivisible private good to n claimants, each valuing the object differently. Individuals have quasi-linear preferences. Therefore, the possibility of transfers is allowed. A second-best efficient mechanism is a strategy-proof and anonymous mechanism that...

A domain of preference orderings is a random dictatorship domain if every strategy-proof random social choice function satisfying unanimity defined on the domain is a random dictatorship. Gibbard (1977) showed that the universal domain is a random dictatorship domain. We ask whether an arbitrary...

A social choice function may or may not satisfy a desirable property depending on its domain of definition. For the same reason, different conditions may be equivalent for functions defined on some domains, while not in other cases. Understanding the role of domains is therefore a crucial issue...

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize the class of rules...

We consider a mechanism design problem in economies with increasing returns. We construct a new class of rules, called w-hybrid rules, and characterize them by strategy-proofness, anonymity, envy-freeness, consumer sovereignty, and non-bossiness. We show that w-hybrid rules improve the supremal...

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategy-proof if misreporting one's preference never produces a different social ordering that is between the original ordering...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on...

This paper inspires from a real-life assignment problem faced by the Mexican Ministry of Public Education. We introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. From one period to another, teachers can either retain their...

We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable...