We establish that the fraction of preference profiles for which the random serial dictatorship allocation is ordinally efficient vanishes for allocation problems with many object types. We consider also a probabilistic setting where in expectation agents have moderately similar preferences...

We establish that the fraction of preference profiles for which the random serial dictatorship allocation is ordinally efficient vanishes for allocation problems with many object types. We consider also a probabilistic setting where in expectation agents have moderately similar preferences...

We consider the problem of randomly assigning n indivisible objects to n agents. Recent research introduced a promising mechanism, the probabilistic serial that has superior efficiency properties than the most common real-life mechanism random priority. On the other hand, mechanisms based on...

The random priority (random serial dictatorship) mechanism is a common method for assigning objects to individuals. The mechanism is easy to implement and strategy-proof. However this mechanism is inefficient, as the agents may be made all better off by another mechanism that increases their...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed. We offer two characterizations of the prominent lottery assignment mechanism called the probabilistic serial. We show that it is the only mechanism satisfying...

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

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

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