DeepAI
Log In Sign Up

Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores

01/19/2021
by   Ankang Sun, et al.
0

We study several fairness notions in allocating indivisible chores (i.e., items with non-positive values): envy-freeness and its relaxations. For allocations under each fairness criterion, we establish their approximation guarantee for other fairness criteria. Under the setting of additive cost functions, our results show strong connections between these fairness criteria and, at the same time, reveal intrinsic differences between goods allocation and chores allocation. Furthermore, we investigate the efficiency loss under these fairness constraints and establish their prices of fairness.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/24/2020

Equitable Allocations of Indivisible Chores

We study fair allocation of indivisible chores (i.e., items with non-pos...
05/28/2020

Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation

We study the problem of allocating indivisible goods among agents with a...
12/08/2021

Weighted Fairness Notions for Indivisible Items Revisited

We revisit the setting of fairly allocating indivisible items when agent...
06/26/2019

Fairness criteria through the lens of directed acyclic graphical models

A substantial portion of the literature on fairness in algorithms propos...
09/20/2022

Fairness and robustness in anti-causal prediction

Robustness to distribution shift and fairness have independently emerged...
06/10/2020

Balancing Fairness and Efficiency in an Optimization Model

Optimization models generally aim for efficiency by maximizing total ben...
10/07/2020

Fairness in Influence Maximization through Randomization

The influence maximization paradigm has been used by researchers in vari...