2 citations · 2 across the 6 of their papers we have counts for
8 papers
Truthful-in-Expectation MMS Allocations for Chores
Zehan Lin, Biaoshuai Tao, Xiaowei Wu +1
We study truthful-in-expectation (TIE) mechanisms for allocating indivisible chores alongside ex-post maximin share (MMS) guarantees. For goods, Bu and Tao (FOCS 2025) established…
MMS Allocation for Chores with Online Agent Arrivals
Haolong Li, Zehan Lin, Huahua Miao +1
We study the fair allocation of indivisible chores to agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed…
Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
Zehan Lin, Xiaowei Wu, Shengwei Zhou
In a web-based review platform, papers from various research fields must be assigned to a group of reviewers. Each paper has an inherent cost, which represents the effort required…
Degree-bounded Online Bipartite Matching: OCS vs. Ranking
Yilong Feng, Haolong Li, Xiaowei Wu +1
We revisit the online bipartite matching problem on -regular graphs, for which Cohen and Wajc (SODA 2018) proposed an algorithm with a competitive ratio of $1-2\sqrt{H_d/d} = 1-…
When is Truthfully Allocating Chores no Harder than Goods?
Bo Li, Biaoshuai Tao, Fangxiao Wang +3
We study the problem of fairly and efficiently allocating a set of items among strategic agents with additive valuations, where items are either all indivisible or all divisible. W…
Approximately EFX and PO Allocations for Bivalued Chores
Zehan Lin, Xiaowei Wu, Shengwei Zhou
We consider the computation for allocations of indivisible chores that are approximately EFX and Pareto optimal (PO). Recently, Garg et al. (2024) show the existence of -EFX and…
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…
Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy
Xiaowei Wu, Shengwei Zhou
We consider the problem of allocating indivisible items to a set of heterogeneous agents, aiming at computing a proportional allocation by introducing subsidy (money). It h…