Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously
We study the problem of computing\emph {fair} divisions of a set of indivisible goods among
agents with\emph {additive} valuations. For the past many decades, the literature has …
agents with\emph {additive} valuations. For the past many decades, the literature has …
EF2X Exists For Four Agents
We study the fair allocation of indivisible goods among a group of agents, aiming to limit the
envy between any two agents. The central open problem in this literature, which has proven …
envy between any two agents. The central open problem in this literature, which has proven …
Low communication protocols for fair allocation of indivisible goods
U Feige - arXiv preprint arXiv:2407.07641, 2024 - arxiv.org
We study the multi-party randomized communication complexity of computing a fair
allocation of $ m $ indivisible goods to $ n< m $ equally entitled agents. We first consider …
allocation of $ m $ indivisible goods to $ n< m $ equally entitled agents. We first consider …