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

We study the problem of assigning indivisible objects to agents where each is to receive one object. To ensure fairness in the absence of monetary compensation, we consider random assignments. Random Priority, also known as Random Serial Dictatorship, is characterized by symmetry, ex-post...

Global games are widely used for equilibrium selection to predict behaviour in complete information games with strategic complementarities. We establish two results on the global game selection. First, we show that it is independent of the payoff functions of the global game embedding, though it...

Global games are widely used for equilibrium selection to predict behaviour in complete information games with strategic complementarities. We establish two results on the global game selection. First we show that it is independent of the payoff functions of the global game embedding, though (as...

We study the problem of assigning indivisible goods to individuals where each is to receive one object. To guarantee fairness in the absence of monetary compensation, we consider random assignments and analyse various equity criteria for such lotteries. In particular, we find that sd-no-envy (as...

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

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

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

We take school admission mechanisms to the lab to test whether the widely-used manipulable Boston-mechanism disadvantages students of lower cognitive ability and whether this leads to ability segregation across schools. Results show this is the case: lower ability participants receive lower...