Numerous simple proofs of the celebrated Gibbard-Satterthwaite theorem (Gibbard, 1977, Satterthwaite, 1975) has been given in the literature. These are based on a number of different intuitions about the most fundamental reason for the result. In this paper we derive the Gibbard-Satterthwaite...

We study the simple model of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. For this model, known as the house allocation model, we characterize the class of rules...

In college admissions and student placements at public schools, the admission decision can be thought of as assigning indivisible objects with capacity constraints to a set of students such that each student receives at most one object and monetary compensations are not allowed. In these...

In school choice problems, the widely used manipulable Immediate Acceptance mechanism (IA) disadvantages unsophisticated applicants, but may ex-ante Pareto dominate any strategy-proof alternative. In these cases, it may be preferable to aid applicants within IA, rather than to abandon it. In a...

We study the random assignment of indivisible objects among a set of agents with strict preferences. We show that there exists no mechanism which is unanimous, strategy-proof and envy-free. Weakening the first requirement to q-unanimity – i.e., when every agent ranks a different object at the...