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

Recent work has highlighted welfare gains from the use of the Boston mechanism over deferred acceptance (DA) in school choice problems, in particular finding that when cardinal utility is taken into account, Boston interim Pareto dominates DA in certain incomplete information environments with...

We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and...

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

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

It is well known that ex post efficient mechanisms for the provision of indivisible public goods are not interim individually rational. However, the corresponding literature assumes that agents who veto a mechanism can enforce a situation in which the public good is never provided. This paper...

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

We compare competing college admission matching mechanisms that differ in preference submission timing (pre-exam, post-exam but pre-score, or post-score) and in matching procedure (Boston (BOS) and serial dictatorship (SD) matching). Pre-exam submission asks students to submit college...

We describe and characterize the family of asymmetric parametric division rules for the adjudication of conflicting claims on a divisible homogeneous good. As part of the characterization, we present two novel axioms which restrict how a division rule indirectly allocates between different...