[HTML][HTML] Fair division of indivisible goods: Recent progress and open questions
Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …
times, with most of the early mathematical work on the problem focusing on resources that …
Fair division of indivisible goods: A survey
Allocating resources to individuals in a fair manner has been a topic of interest since the
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
ancient times, with most of the early rigorous mathematical work on the problem focusing on …
Algorithmic fair allocation of indivisible items: A survey and new questions
The theory of algorithmic fair allocation is at the center of multi-agent systems and
economics in recent decades due to its industrial and social importance. At a high level, the …
economics in recent decades due to its industrial and social importance. At a high level, the …
Maximum Nash welfare and other stories about EFX
We consider the classic problem of fairly allocating indivisible goods among agents with
additive valuation functions and explore the connection between two prominent fairness …
additive valuation functions and explore the connection between two prominent fairness …
[HTML][HTML] Weighted fair division of indivisible items: A review
W Suksompong - Information Processing Letters, 2024 - Elsevier
Fair division is a longstanding problem in economics and has recently received substantial
interest in computer science. Several applications of fair division involve agents with …
interest in computer science. Several applications of fair division involve agents with …
A little charity guarantees almost envy-freeness
BR Chaudhury, T Kavitha, K Mehlhorn… - SIAM Journal on …, 2021 - SIAM
The fair division of indivisible goods is a very well-studied problem. The goal of this problem
is to distribute m goods to n agents in a “fair” manner, where every agent has a valuation for …
is to distribute m goods to n agents in a “fair” manner, where every agent has a valuation for …
EFX: a simpler approach and an (almost) optimal guarantee via rainbow cycle number
The existence of envy-freeness up to any good (EFX) allocations is a fundamental open
problem in discrete fair division. The goal is to determine the existence of an allocation of a …
problem in discrete fair division. The goal is to determine the existence of an allocation of a …
On approximate envy-freeness for indivisible chores and mixed resources
U Bhaskar, AR Sricharan, R Vaish - arXiv preprint arXiv:2012.06788, 2020 - arxiv.org
We study the fair allocation of undesirable indivisible items, or chores. While the case of
desirable indivisible items (or goods) is extensively studied, with many results known for …
desirable indivisible items (or goods) is extensively studied, with many results known for …
Improving EFX guarantees through rainbow cycle number
We study the problem of fairly allocating a set of indivisible goods among n agents with
additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling …
additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling …
The price of fairness for indivisible goods
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 …
price of fairness concept. Previous work has focused on classical fairness notions such as …