← 研踪 PaperTrailarXiv:2609.08687 · v2
Comparison-Based Fair Division of Indivisible Chores
首次提交 2026-09-08 20:55
版本更新 2026-11-17 22:21
雷达观测 2026-11-18 16:38
摘要
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 only comparison access: an algorithm is only allowed to ask an agent which of two bundles is less costly, and it never observes numerical costs. Our first results concern proportionality up to one item (PROP1). We design comparison-based algorithms that compute PROP1 allocations using comparison queries. When the chores are arranged in a fixed order, and allocations are required to be contiguous, we compute a contiguous PROP1 allocation using comparison queries. Our main result concerns the maximin share (MMS) guarantee. We show that for any fixed number of agents and constant , a -MMS allocation can be computed with a comparison complexity logarithmic in . Remarkably, comparison access suffices to match the state-of-the-art cardinal-access guarantee of Huang and Segal-Halevi up to an arbitrarily small loss. Furthermore, our result implies that the MMS distortion of comparison access (i.e., the worst-case multiplicative loss in MMS fairness incurred by observing only comparisons rather than numerical costs) is at most . Finally, we show that, for three agents, an allocation satisfying envy-freeness up to one item (EF1) can be computed using comparison queries.
作者备注:46 pages and 4 figures. A preliminary version has been accepted to SODA 2027. This version improves the contiguous PROP1 query complexity to the optimal $O(\log m)$ for fixed $n$ and the MMS distortion lower bound to $31/30$
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-17 22:21 · 最新观测版本
Comparison-Based Fair Division of Indivisible Chores
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 only comparison access: an algorithm is only allowed to ask an agent which of two bundles is less costly, and it never observes numerical costs. Our first results concern proportionality up to one item (PROP1). We design comparison-based algorithms that compute PROP1 allocations using comparison queries. When the chores are arranged in a fixed order, and allocations are required to be contiguous, we compute a contiguous PROP1 allocation using comparison queries. Our main result concerns the maximin share (MMS) guarantee. We show that for any fixed number of agents and constant , a -MMS allocation can be computed with a comparison complexity logarithmic in . Remarkably, comparison access suffices to match the state-of-the-art cardinal-access guarantee of Huang and Segal-Halevi up to an arbitrarily small loss. Furthermore, our result implies that the MMS distortion of comparison access (i.e., the worst-case multiplicative loss in MMS fairness incurred by observing only comparisons rather than numerical costs) is at most . Finally, we show that, for three agents, an allocation satisfying envy-freeness up to one item (EF1) can be computed using comparison queries.
查看此版本解读 →查看此版本原文 ↗