2 citations · 5 across the 16 of their papers we have counts for
5 papers · 1 filter
Comparison-Based Fair Division of Indivisible Chores
Zehan Lin, Shengxin Liu, Biaoshuai Tao +1
We investigate the query complexity of fairly allocating indivisible chores among agents with additive cost functions. We depart from the standard cardinal model and assume…
Almost Envy-Freeness for Additive Mixed Manna with Entitlements: Deterministic and Randomized Guarantees
Zehan Lin, Shengxin Liu, Biaoshuai Tao +1
We investigate the fair allocation of indivisible items among agents with asymmetric entitlements in mixed manna settings, where the items consist of both goods and chores. For add…
Non-Existence of EFX Chore Allocations for Monotone Cost Functions with Binary Marginals
Zehan Lin, Shengxin Liu, Biaoshuai Tao +1
We study the existence of envy-free up to any item (EFX) allocations of indivisible chores when agents have monotone cost functions with binary marginals. For indivisible goods, th…
Fair Division by Contribution: A Shapley Value Perspective
Xiaohui Bei, Pinyan Lu, Xiaowei Wu +1
In many resource allocation problems, agents' valuations are best interpreted not as subjective preferences, but as the value they generate from receiving resources. Such valuation…
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…