Preprint
Sep 2026
Comparison-Based Fair Division of Indivisible Chores
We investigate the query complexity of fairly allocating $m$ indivisible chores among $n$ agents with additive cost functions. We depart from the standard cardinal model and assume only comparison access: an algorithm may ask an agent which of two bundles is less costly, but never observes numerical costs. Our first re...
Ze-Han Lin, Shengxin Liu, Biaoshuai Tao et al.
· 0 citations