93 citations · 155 across the 32 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.GT2021★ 1 cited
Approximately EFX Allocations for Indivisible Chores
Shengwei Zhou, Xiaowei Wu
In this paper, we study how to fairly allocate a set of m indivisible chores to a group of n agents, each of which has a general additive cost function on the items. Since envy-fre…
cs.GT2021★ 4 cited
Approximately Envy-Free Budget-Feasible Allocation
Jiarui Gan, Bo Li, Xiaowei Wu
In the budget-feasible allocation problem, a set of items with varied sizes and values are to be allocated to a group of agents. Each agent has a budget constraint on the total siz…
cs.GT2021★ 5 cited
Almost (Weighted) Proportional Allocations for Indivisible Chores
Bo Li, Yingkai Li, Xiaowei Wu
In this paper, we study how to fairly allocate m indivisible chores to n (asymmetric) agents. We consider (weighted) proportionality up to any item (PROPX) and show that a (weighte…