[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 …
Almost envy-freeness with general valuations
B Plaut, T Roughgarden - SIAM Journal on Discrete Mathematics, 2020 - SIAM
The goal of fair division is to distribute resources among competing players in a “fair" way.
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …
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] Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
G Amanatidis, E Markakis, A Ntokos - Theoretical Computer Science, 2020 - Elsevier
Several relaxations of envy-freeness, tailored to fair division in settings with indivisible
goods, have been introduced within the last decade. Due to the lack of general existence …
goods, have been introduced within the last decade. Due to the lack of general existence …
Approximately EFX allocations for indivisible chores
In this paper, we study how to fairly allocate a set of m indivisible chores to a group of n
agents, each of which has a general additive cost function on the items. Since envy-free (EF) …
agents, each of which has a general additive cost function on the items. Since envy-free (EF) …
Pushing the frontier on approximate EFX allocations
G Amanatidis, A Filos-Ratsikas… - Proceedings of the 25th …, 2024 - dl.acm.org
We study the problem of allocating a set of indivisible goods to a set of agents with additive
valuation functions, aiming to achieve approximate envy-freeness up to any good (α-EFX) …
valuation functions, aiming to achieve approximate envy-freeness up to any good (α-EFX) …
Fair allocation in graphs
We study envy freeness up to any good (EFX) in settings where valuations can be
represented via a graph of arbitrary size where vertices correspond to agents and edges to …
represented via a graph of arbitrary size where vertices correspond to agents and edges to …
Breaking the envy cycle: Best-of-both-worlds guarantees for subadditive valuations
We study best-of-both-worlds guarantees for the fair division of indivisible items among
agents with subadditive valuations. Our main result establishes the existence of a random …
agents with subadditive valuations. Our main result establishes the existence of a random …
Fair allocation of a multiset of indivisible items
We study the problem of fairly allocating a multiset M of m indivisible items among n agents
with additive valuations. Specifically, we introduce a parameter t for the number of distinct …
with additive valuations. Specifically, we introduce a parameter t for the number of distinct …