2 papers
cs.GT2026
From Cake-Cutting and Necklace-Splitting to Fair Division of Indivisible Items
Max Dupré la Tour, Ayumi Igarashi
We give an existential transfer framework for converting continuous fair division theorems into guarantees for indivisible items arranged on a path. This allows continuous envy-fre…
cs.GT2026
Tight Asymptotic Bounds for Fair Division With Externalities
Frank Connor, Max Dupré la Tour, Vishnu V. Narayan +1
We study the problem of allocating a set of indivisible items among agents whose preferences include externalities. Unlike the standard fair division model, agents may derive posit…