# Settling the Price of Fairness for Indivisible Goods

@article{Barman2020SettlingTP, title={Settling the Price of Fairness for Indivisible Goods}, author={Siddharth Barman and Umang Bhaskar and Nisarg Shah}, journal={ArXiv}, year={2020}, volume={abs/2007.06242} }

In the allocation of resources to a set of agents, how do fairness guarantees impact the social welfare? A quantitative measure of this impact is the price of fairness, which measures the worst-case loss of social welfare due to fairness constraints. While initially studied for divisible goods, recent work on the price of fairness also studies the setting of indivisible goods.
In this paper, we resolve the price of two well-studied fairness notions for the allocation of indivisible goods: envy… Expand

#### Figures and Topics from this paper

#### 6 Citations

The Price of Fairness for Indivisible Goods

- Computer Science, Economics
- Theory Comput. Syst.
- 2021

This paper focuses on notions with guaranteed existence, including envy-freeness up to one good (EF1), balancedness, maximum Nash welfare (MNW), and leximin, and introduces the concept of strong price of fairness, which captures the efficiency loss in the worst fair allocation as opposed to that in the best fair allocation. Expand

Computing Welfare-Maximizing Fair Allocations of Indivisible Goods

- Computer Science
- 2020

This work considers the computational complexity of computing allocations that are both fair and maximize the utilitarian social welfare, i.e., the sum of agents’ utilities, and designs pseudopolynomial-time algorithms for both problems. Expand

Computing Fair Utilitarian Allocations of Indivisible Goods

- Computer Science
- ArXiv
- 2020

Focusing on the special case of two agents, it is found that problem (1) is polynomial-time solvable, whereas problem (2) remains NP-hard. Expand

Fairness Criteria for Allocating Indivisible Chores: Connections and Efficiencies

- Computer Science
- 2021

Under the additive setting, the results show strong connections between these fairness criteria and, at the same time, reveal intrinsic differences between goods allocation and chores allocation. Expand

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

- Computer Science
- EC
- 2020

Ex-ante group fairness is able to be achieved, which generalizes both envy-freeness and Pareto optimality, in conjunction with two ex-post fairness properties that are incomparable but are both implied by EF1: proportionality up to one good or Prop1 and envy- freeness up toone good more-and-less. Expand

Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores

- Computer Science
- AAMAS
- 2021

Under the setting of additive cost functions, the results show strong connections between these fairness criteria and, at the same time, reveal intrinsic differences between goods allocation and chores allocation. Expand

#### References

SHOWING 1-10 OF 35 REFERENCES

The Price of Fairness for Indivisible Goods

- Economics, Computer Science
- IJCAI
- 2019

This paper investigates the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept, and provides tight or asymptotically tight bounds on the worst-case efficiency loss for allocations satisfying notions with guaranteed existence, including envy-freeness up to one good, balancedness, maximum Nash welfare, and leximin. Expand

On approximately fair allocations of indivisible goods

- Mathematics, Computer Science
- EC '04
- 2004

In the presence of indivisibilities, it is shown that there exist allocations in which the envy is bounded by the maximum marginal utility, and an algorithm for computing such allocations is presented. Expand

Fair Allocation of Indivisible Goods: Improvements and Generalizations

- Computer Science, Mathematics
- EC
- 2018

This work introduces three notions and techniques, namely reducibility, matching allocation, and cycle-envy-freeness, and proves the approximation guarantee of the algorithm via non-trivial applications of these techniques, and gives constant approximation guarantees for submodular and XOS agents, and a logarithmic approximation for the case of subadditive agents. Expand

Fair Allocation of Indivisible Goods and Chores

- Computer Science
- IJCAI
- 2019

This paper considers a more general scenario where an agent may have negative or positive utility for each item, e.g., fair task assignment, where agents can have both positive and negative utilities for each task. Expand

Finding Fair and Efficient Allocations

- Computer Science, Mathematics
- EC
- 2018

A pseudopolynomial time algorithm for finding allocations that are EF1 and Pareto efficient; in particular, when the valuations are bounded, the algorithm finds such an allocation in polynomial time. Expand

The Unreasonable Fairness of Maximum Nash Welfare

- Computer Science, Economics
- EC
- 2016

It is proved that the maximum Nash welfare solution selects allocations that are envy free up to one good --- a compelling notion that is quite elusive when coupled with economic efficiency. Expand

The Efficiency of Fair Division

- Computer Science, Economics
- Theory of Computing Systems
- 2011

This study considers three different notions of fairness, namely proportionality, envy-freeness, and equitability for allocations of divisible and indivisible goods and chores, and presents a series of results on the price of fairness under thethree different notions that quantify the efficiency loss in fair allocations compared to optimal ones. Expand

Groupwise Maximin Fair Allocation of Indivisible Goods

- Computer Science, Mathematics
- AAAI
- 2018

A stronger notion of fairness is defined, called groupwise maximin share guarantee (GMMS), which requires that the maxim in share guarantee is achieved not just with respect to the grand bundle, but also among all the subgroups of agents and provides an ex-post fairness guarantee. Expand

Algorithms for Max-Min Share Fair Allocation of Indivisible Chores

- Computer Science
- AAAI
- 2017

It is shown that allocation of chores and classical allocation of goods have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa, and a new fairness concept called optimal MmS is introduced that represents the best possible allocation in terms of MmM that is guaranteed to exist. Expand

The Price of Fairness

- Computer Science, Economics
- Oper. Res.
- 2011

The price of fairness is introduced and studied, which is the relative system efficiency loss under a “fair” allocation assuming that a fully efficient allocation is one that maximizes the sum of player utilities. Expand