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

research
02/22/2023

Fair Chore Division under Binary Supermodular Costs

We study the problem of dividing indivisible chores among agents whose c...
research
12/05/2022

Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores

We study the problem of fairly and efficiently allocating indivisible ch...
research
06/01/2023

Unfair Utilities and First Steps Towards Improving Them

Many fairness criteria constrain the policy or choice of predictors. In ...
research
06/26/2019

Fairness criteria through the lens of directed acyclic graphical models

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

Fairness and robustness in anti-causal prediction

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

Balancing Fairness and Efficiency in an Optimization Model

Optimization models generally aim for efficiency by maximizing total ben...
research
12/08/2021

Weighted Fairness Notions for Indivisible Items Revisited

We revisit the setting of fairly allocating indivisible items when agent...

Please sign up or login with your details

Forgot password? Click here to reset