Preprint
Sep 2026
A rainbow partition theorem for trees and connected maximin share allocations of chores
Xiao, Qiu, and Huang (AAMAS 2023) and independently Lonc (personal communication) asked whether indivisible chores located at the vertices of a tree can always be allocated to $n$ agents in connected bundles so that the cost of every agent is at most its connected maximin share; for goods, this is a theorem of Bouveret...
Marcin Anholcer, Maciej Bartkowiak, B. Bosek et al.
· 0 citations