Fairly dividing mixtures of goods and chores under lexicographic preferences
We study fair allocation of indivisible goods and chores among agents with\emph
{lexicographic} preferences--a subclass of additive valuations. In sharp contrast to the goods …
{lexicographic} preferences--a subclass of additive valuations. In sharp contrast to the goods …
Fairly allocating goods and (terrible) chores
We study the fair allocation of mixtures of indivisible goods and chores under lexicographic
preferences $\unicode {x2014} $ a subdomain of additive preferences. A prominent fairness …
preferences $\unicode {x2014} $ a subdomain of additive preferences. A prominent fairness …
Fair and efficient allocations under lexicographic preferences
Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in
the allocation of indivisible goods. But whether such allocations always exist or whether they …
the allocation of indivisible goods. But whether such allocations always exist or whether they …
A complexity approach for core-selecting exchange under conditionally lexicographic preferences
Core-selection is a crucial property of rules in the literature of resource allocation. It is also
desirable, from the perspective of mechanism design, to address the incentive of agents to …
desirable, from the perspective of mechanism design, to address the incentive of agents to …
Incentive properties for ordinal mechanisms
WJ Cho - Games and Economic Behavior, 2016 - Elsevier
We study three incentive properties for ordinal mechanisms:(i) strategy-proofness, which
requires that no agent gain by misrepresenting his preferences;(ii) adjacent strategy …
requires that no agent gain by misrepresenting his preferences;(ii) adjacent strategy …
A generalization of probabilistic serial to randomized social choice
H Aziz, P Stursberg - Proceedings of the AAAI Conference on Artificial …, 2014 - ojs.aaai.org
The probabilistic serial rule is one of the most well-established and desirable rules for the
random assignment problem. We present the egalitarian simultaneous reservation social …
random assignment problem. We present the egalitarian simultaneous reservation social …
Allocation of divisible goods under lexicographic preferences
LJ Schulman, VV Vazirani - arXiv preprint arXiv:1206.4366, 2012 - arxiv.org
We present a simple and natural non-pricing mechanism for allocating divisible goods
among strategic agents having lexicographic preferences. Our mechanism has favorable …
among strategic agents having lexicographic preferences. Our mechanism has favorable …
Random Serial Dictatorship for horizontal collaboration in logistics
In this paper, we propose the application of matching mechanisms to handle horizontal
collaboration in logistics. Based on the requirements of a real-life setting, we introduce a …
collaboration in logistics. Based on the requirements of a real-life setting, we introduce a …
[PDF][PDF] Multiple assignment problems under lexicographic preferences
H Hosseini, K Larson - … of the 18th International Conference on …, 2019 - ifaamas.org
Assignment problems are fundamental in numerous multiagent systems and fair division
problems [12, 17]. We consider the problem of allocating indivisible objects to agents without …
problems [12, 17]. We consider the problem of allocating indivisible objects to agents without …
Manipulating the probabilistic serial rule
The probabilistic serial (PS) rule is one of the most prominent randomized rules for the
assignment problem. It is well-known for its superior fairness and welfare properties …
assignment problem. It is well-known for its superior fairness and welfare properties …