We study the problem of fairly allocating a divisible resource in the form of a graph, also known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy …
B Li, A Sun, S Xing - arXiv preprint arXiv:2410.15738, 2024 - arxiv.org
In this paper, we study the allocation of indivisible chores and consider the problem of finding a fair allocation that is approximately efficient. We shift our attention from the …
A Lam, B Li, A Sun - arXiv preprint arXiv:2501.01660, 2025 - arxiv.org
We adopt a parametric approach to analyze the worst-case degradation in social welfare when the allocation of indivisible goods is constrained to be fair. Specifically, we are …
We consider the classical cake cutting problem where we wish to fairly divide a heterogeneous resource among interested agents. Work on this subject typically assumes …