2 citations · 2 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.GT2026
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…
cs.GT2026
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…
cs.GT2026
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…