Best of Both Worlds: Agents with Entitlements

09/08/2022
by   Martin Hoefer, et al.
0

Fair division of indivisible goods is a central challenge in artificial intelligence. For many prominent fairness criteria including envy-freeness (EF) or proportionality (PROP), no allocations satisfying these criteria might exist. Two popular remedies to this problem are randomization or relaxation of fairness concepts. A timely research direction is to combine the advantages of both, commonly referred to as Best of Both Worlds (BoBW). We consider fair division with entitlements, which allows to adjust notions of fairness to heterogeneous priorities among agents. This is an important generalization to standard fair division models and is not well-understood in terms of BoBW results. Our main result is a lottery for additive valuations and different entitlements that is ex-ante weighted envy-free (WEF), as well as ex-post weighted proportional up to one good (WPROP1) and weighted transfer envy-free up to one good (WEF(1,1)). It can be computed in strongly polynomial time. We show that this result is tight - ex-ante WEF is incompatible with any stronger ex-post WEF relaxation. In addition, we extend BoBW results on group fairness to entitlements and explore generalizations of our results to instances with more expressive valuation functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2023

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements

We consider the problem of fair allocation of indivisible goods or chore...
research
06/11/2018

Lecture Notes on Fair Division

Fair division is the problem of dividing one or several goods amongst tw...
research
04/07/2023

Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations

We study best-of-both-worlds guarantees for the fair division of indivis...
research
03/07/2023

Best-of-Both-Worlds Fairness in Committee Voting

The paradigm of best-of-both-worlds advocates an approach that achieves ...
research
12/08/2022

Hide, Not Seek: Perceived Fairness in Envy-Free Allocations of Indivisible Goods

Fair division provides a rich computational and mathematical framework f...
research
02/15/2021

On Interim Envy-Free Allocation Lotteries

With very few exceptions, recent research in fair division has mostly fo...
research
08/01/2020

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores

We study the chore division problem where a set of agents needs to divid...

Please sign up or login with your details

Forgot password? Click here to reset