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

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

Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demanding school choice mechanisms. Disclosing information on applications in previous admission periods makes it easier to asses the chances of being admitted at a particular school, and hence may...

Unsophisticated applicants can be at a disadvantage under manipulable and hence strategically demanding school choice mechanisms. Disclosing information on applications in previous admission periods makes it easier to assess the chances of being admitted at a particular school, and hence may...