3 papers
cs.GT2026
Constant Weighted Maximin Share Approximations for Chores
Bo Li, Fangxiao Wang, Shiji Xing
We study the fair allocation of indivisible chores among agents with asymmetric weights. Among the various fairness notions, weighted maximin share (WMMS) stands out as particularl…
cs.GT2025
On the Subsidy of Envy-Free Orientations in Graphs
Bo Li, Ankang Sun, Mashbat Suzuki +1
We study a fair division problem in (multi)graphs where agents (vertices) are pairwise connected by items (edges), and each agent is only interested in its incident items. We c…
cs.GT2024
A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
Bo Li, Ankang Sun, Shiji Xing
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…