We study the random assignment of indivisible objects among a set of agents with strict preferences. Random Serial Dictatorship is known to be only ex-post efficient and there exist mechanisms which Pareto-dominate it ex ante. However, we show that there is no mechanism that is likewise (i)...

Consider a setting in which individual strict preferences need to be aggregated into a social strict preference relation. For two alternatives and an odd number of agents, it follows from May’s Theorem that the majority aggregation rule is the only one satisfying anonymity, neutrality, and...

We study the random assignment of indivisible objects among a set of agents with strict preferences. Random Serial Dictatorship is known to be only ex-post efficient and there exist mechanisms which Pareto-dominate it ex ante. However, we show that there is no mechanism that is likewise (i)...

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