[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 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 …

[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 …

Weighted envy-freeness for submodular valuations

L Montanari, U Schmidt-Kraepelin… - Proceedings of the …, 2024 - ojs.aaai.org
We investigate the fair allocation of indivisible goods to agents with possibly different
entitlements represented by weights. Previous work has shown that guarantees for additive …

The price of connectivity in fair division

X Bei, A Igarashi, X Lu, W Suksompong - SIAM journal on Discrete …, 2022 - SIAM
We study the allocation of indivisible goods that form an undirected graph and quantify the
loss of fairness when we impose a constraint that each agent must receive a connected …

Round-robin beyond additive agents: Existence and fairness of approximate equilibria

G Amanatidis, G Birmpas, P Lazos, S Leonardi… - Proceedings of the 24th …, 2023 - dl.acm.org
Fair allocation of indivisible goods has attracted extensive attention over the last two
decades, yielding numerous elegant algorithmic results and producing challenging open …

Temporal fair division of indivisible items

E Elkind, A Lam, M Latifian, TY Neoh, N Teh - arxiv preprint arxiv …, 2024 - arxiv.org
We study a fair division model where indivisible items arrive sequentially, and must be
allocated immediately and irrevocably. Previous work on online fair division has shown …

On picking sequences for chores

U Feige, X Huang - Proceedings of the 24th ACM Conference on …, 2023 - dl.acm.org
We consider the problem of allocating m indivisible chores to n agents with additive
disvaluation (cost) functions. It is easy to show that there are picking sequences that give …

A framework for fair decision-making over time with time-invariant utilities

A Lodi, S Sankaranarayanan, G Wang - European Journal of Operational …, 2024 - Elsevier
Fairness is a major concern in contemporary decision problems. In these situations, the
objective is to maximize fairness while preserving the efficacy of the underlying decision …

Maximin shares in hereditary set systems

H Hummel - arxiv preprint arxiv:2404.11582, 2024 - arxiv.org
We consider the problem of fairly allocating a set of indivisible items under the criteria of the
maximin share guarantee. Specifically, we study approximation of maximin share allocations …