MMS Allocation for Chores with Online Agent Arrivals

Haolong Li, Zehan Lin, Huahua Miao +1

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…