2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.GT2024
Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
Jiawei Qiu, Xiaowei Wu, Cong Zhang +1
We study the problem of allocating indivisible chores to agents with additive cost functions under the fairness notion of maximin share (MMS). In this work, we propose a no…
cs.GT2023
One Quarter Each (on Average) Ensures Proportionality
Xiaowei Wu, Cong Zhang, Shengwei Zhou
We consider the problem of fair allocation of indivisible items to a group of agents with subsidy (money). Our work mainly focuses on the allocation of chores but most of o…
cs.GT2023★ 2 cited
Weighted EF1 Allocations for Indivisible Chores
Xiaowei Wu, Cong Zhang, Shengwei Zhou
We study how to fairly allocate a set of indivisible chores to a group of agents, where each agent has a non-negative weight that represents its obligation for undertakin…