Preprint
Sep 2026
MMS Allocation for Chores with Online Agent Arrivals
We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to comput...
Hao-Long Li, Ze-Han Lin, Hua-Hua Miao et al.
· 0 citations