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

How to fairly allocate easy and difficult chores

S Ebadian, D Peters, N Shah - arXiv preprint arXiv:2110.11285, 2021 - arxiv.org
A major open question in fair allocation of indivisible items is whether there always exists an
allocation of chores that is Pareto optimal (PO) and envy-free up to one item (EF1). We …

Computing fair and efficient allocations with few utility values

J Garg, A Murhekar - Theoretical Computer Science, 2023 - Elsevier
We study the problem of allocating indivisible goods among agents with additive valuations
in a fair and efficient manner, when agents have few utility values for the goods. We consider …

Approximately EFX allocations for indivisible chores

S Zhou, X Wu - Artificial Intelligence, 2024 - Elsevier
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) …

[HTML][HTML] On maximum weighted Nash welfare for binary valuations

W Suksompong, N Teh - Mathematical Social Sciences, 2022 - Elsevier
We consider the problem of fairly allocating indivisible goods to agents with weights
representing their entitlements. A natural rule in this setting is the maximum weighted Nash …

Fair Division of Indivisible Goods: Recent Progress and Open Questions

G Amanatidis, H Aziz, G Birmpas… - arXiv preprint arXiv …, 2022 - arxiv.org
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 …

Maximizing Nash Social Welfare under Two-Sided Preferences

P Jain, R Vaish - Proceedings of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
The maximum Nash social welfare (NSW)---which maximizes the geometric mean of agents'
utilities---is a fundamental solution concept with remarkable fairness and efficiency …

A fair and truthful mechanism with limited subsidy

H Goko, A Igarashi, Y Kawase, K Makino… - Games and Economic …, 2024 - Elsevier
The notion of envy-freeness is a natural and intuitive fairness requirement in resource
allocation. With indivisible goods, such fair allocations are not guaranteed to exist. Classical …

The good, the bad and the submodular: Fairly allocating mixed manna under order-neutral submodular preferences

C Cousins, V Viswanathan, Y Zick - International Conference on Web and …, 2023 - Springer
We study the problem of fairly allocating indivisible goods (positively valued items) and
chores (negatively valued items) among agents with decreasing marginal utilities over items …