2 papers
math.CO2026
A rainbow partition theorem for trees and connected maximin share allocations of chores
Marcin Anholcer, Maciej Bartkowiak, Bartłomiej Bosek +3
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 …
math.OC2026
Epistemic fair division of independence structures
Marcin Anholcer, Maciej Bartkowiak, Bartłomiej Bosek +1
We study the problem of fair division of indivisible goods with constraints imposed by a prescribed independence structure, that is, a family of subsets of goods closed under takin…