The Price of Fairness for Indivisible Goods

05/13/2019
by   Xiaohui Bei, et al.
0

We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions such as envy-freeness, proportionality, and equitability. However, these notions cannot always be satisfied for indivisible goods, leading to certain instances being ignored in the analysis. In this paper, we focus instead on notions with guaranteed existence, including envy-freeness up to one good (EF1), balancedness, maximum Nash welfare (MNW), and leximin. We mostly provide tight or asymptotically tight bounds on the worst-case efficiency loss for allocations satisfying these notions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2020

Settling the Price of Fairness for Indivisible Goods

In the allocation of resources to a set of agents, how do fairness guara...
research
05/22/2022

On the Price of Fairness of Allocating Contiguous Blocks

In this work, we revisit the problem of fairly allocating a number of in...
research
06/08/2018

Comparing Approximate Relaxations of Envy-Freeness

In fair division problems with indivisible goods it is well known that o...
research
02/11/2021

Fairness Through Regularization for Learning to Rank

Given the abundance of applications of ranking in recent years, addressi...
research
07/13/2023

The Price of Equity with Binary Valuations and Few Agent Types

In fair division problems, the notion of price of fairness measures the ...
research
06/26/2023

Fairness Aware Counterfactuals for Subgroups

In this work, we present Fairness Aware Counterfactuals for Subgroups (F...
research
06/24/2018

Equalizing Financial Impact in Supervised Learning

Notions of "fair classification" that have arisen in computer science ge...

Please sign up or login with your details

Forgot password? Click here to reset