Aziz and Stursberg propose an “Egalitarian Simultaneous Reservation” rule (ESR), a generalization of Serial rule, one of the most discussed mechanisms in the random assignment problem, to the more general random social choice domain. This article provides an alternative definition, or characterization, of ESR as the unique most ordinally egalitarian one. Specifically, given a lottery p over alternatives, for each agent i the author considers the total probability share in p of objects from her first k indifference classes. ESR is shown to be the unique one which leximin maximizes the vector of all such shares (calculated for all i, k). Serial rule is known to be characterized by the same property. Thus, the author provides an alternative wa...
We reconsider the problem of aggregating individual preference orderings into a single social orderi...
This paper seeks to identify which algorithm to employ in a situation where goods are distributed t...
This paper studies the problem of assigning a set of indivisible objects to a set of agents when mon...
The probabilistic serial rule is one of the most well-established and desirable rules for the random...
We provide a new, welfarist, interpretation of the well-known Serial rule in the random assignment p...
We consider the egalitarian welfare of random assignment mechanisms when agents have unrestricted ca...
This paper studies the problem of assigning a set of indivisible objects to a set of agents when mon...
Thesis (Ph. D.)--University of Rochester. Dept. of Economics, 2012.This thesis is a collection of es...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
Efficiency and symmetric treatment of agents are the primary goals of resource allocation in environ...
Abstract. In the random assignment problem, the probabilistic serial mechanism (Bo-gomolnaia and Mou...
Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over ...
Also presented at ICSE '06: 28th International Conference on Software Engineering: 20-28 May 2006, S...
We study random assignment of indivisible objects among a set of agents with strict preferences. Ra...
The random priority (random serial dictatorship) mechanism is a common method for assigning objects ...
We reconsider the problem of aggregating individual preference orderings into a single social orderi...
This paper seeks to identify which algorithm to employ in a situation where goods are distributed t...
This paper studies the problem of assigning a set of indivisible objects to a set of agents when mon...
The probabilistic serial rule is one of the most well-established and desirable rules for the random...
We provide a new, welfarist, interpretation of the well-known Serial rule in the random assignment p...
We consider the egalitarian welfare of random assignment mechanisms when agents have unrestricted ca...
This paper studies the problem of assigning a set of indivisible objects to a set of agents when mon...
Thesis (Ph. D.)--University of Rochester. Dept. of Economics, 2012.This thesis is a collection of es...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
Efficiency and symmetric treatment of agents are the primary goals of resource allocation in environ...
Abstract. In the random assignment problem, the probabilistic serial mechanism (Bo-gomolnaia and Mou...
Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over ...
Also presented at ICSE '06: 28th International Conference on Software Engineering: 20-28 May 2006, S...
We study random assignment of indivisible objects among a set of agents with strict preferences. Ra...
The random priority (random serial dictatorship) mechanism is a common method for assigning objects ...
We reconsider the problem of aggregating individual preference orderings into a single social orderi...
This paper seeks to identify which algorithm to employ in a situation where goods are distributed t...
This paper studies the problem of assigning a set of indivisible objects to a set of agents when mon...