[HTML][HTML] Fair division of indivisible goods: Recent progress and open questions

G Amanatidis, H Aziz, G Birmpas, A Filos-Ratsikas… - Artificial Intelligence, 2023 - Elsevier
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 …

Fair division in the internet age

H Moulin - Annual Review of Economics, 2019 - annualreviews.org
Fair division, a key concern in the design of many social institutions, has for 70 years been
the subject of interdisciplinary research at the interface of mathematics, economics, and …

Fair division of indivisible goods: A survey

G Amanatidis, G Birmpas, A Filos-Ratsikas… - arXiv preprint arXiv …, 2022 - arxiv.org
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 …

EFX exists for three agents

BR Chaudhury, J Garg, K Mehlhorn - Journal of the ACM, 2024 - dl.acm.org
We study the problem of distributing a set of indivisible goods among agents with additive
valuations in a fair manner. The fairness notion under consideration is envy-freeness up to …

Algorithmic fair allocation of indivisible items: A survey and new questions

H Aziz, B Li, H Moulin, X Wu - ACM SIGecom Exchanges, 2022 - dl.acm.org
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 …

Maximum Nash welfare and other stories about EFX

G Amanatidis, G Birmpas, A Filos-Ratsikas… - Theoretical Computer …, 2021 - Elsevier
We consider the classic problem of fairly allocating indivisible goods among agents with
additive valuation functions and explore the connection between two prominent fairness …

Fair allocation of indivisible goods and chores

H Aziz, I Caragiannis, A Igarashi, T Walsh - Autonomous Agents and Multi …, 2022 - Springer
We consider the problem of fairly dividing a set of indivisible items. Much of the fair division
literature assumes that the items are “goods” that yield positive utility for the agents. There is …

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 …

Fair allocation of indivisible goods: Improvements and generalizations

M Ghodsi, MT HajiAghayi, M Seddighin… - Proceedings of the …, 2018 - dl.acm.org
We study the problem of fair allocation for indivisible goods. We use the maxmin share
paradigm introduced by Budish~\citeBudish: first as a measure for fairness.\procacciafirst …

EFX: a simpler approach and an (almost) optimal guarantee via rainbow cycle number

H Akrami, N Alon, BR Chaudhury, J Garg… - Operations …, 2024 - pubsonline.informs.org
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 …