Fair and Efficient Allocations under Lexicographic Preferences

12/14/2020
by   Hadi Hosseini, et al.
0

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 can be efficiently computed remains an important open question. We study the existence and computation of EFX in conjunction with various other economic properties under lexicographic preferences–a well-studied preference model in artificial intelligence and economics. In sharp contrast to the known results for additive valuations, we not only prove the existence of EFX and Pareto optimal allocations, but in fact provide an algorithmic characterization of these two properties. We also characterize the mechanisms that are, in addition, strategyproof, non-bossy, and neutral. When the efficiency notion is strengthened to rank-maximality, we obtain non-existence and computational hardness results, and show that tractability can be restored when EFX is relaxed to another well-studied fairness notion called maximin share guarantee (MMS).

READ FULL TEXT

page 1

page 2

page 3

page 4

03/14/2022

Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences

We study fair allocation of indivisible goods and chores among agents wi...
12/23/2020

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations

We study fair and economically efficient allocation of indivisible goods...
05/20/2021

Fair and Efficient Resource Allocation with Partial Information

We study the fundamental problem of allocating indivisible goods to agen...
03/02/2022

Low-Degree Multicalibration

Introduced as a notion of algorithmic fairness, multicalibration has pro...
07/30/2020

Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents

We propose a notion of algorithmic stability for scenarios where cardina...
04/06/2016

Efficiency and Sequenceability in Fair Division of Indivisible Goods with Additive Preferences

In fair division of indivisible goods, using sequences of sincere choice...
01/29/2021

Sequential Mechanisms for Multi-type Resource Allocation

Several resource allocation problems involve multiple types of resources...