Preprint
Sep 2026
Single-or-Sample: Online Fair Allocation for Combinatorial Agents
We study the problem of fairly allocating $m$ indivisible goods among $n$ agents who arrive online, under the notion of maximin share (MMS) fairness. Fair allocation with online arrivals is notoriously challenging: prior work achieves constant-factor MMS guarantees only when agents'preferences belong to a set of valuat...
Shuchi Chawla, Zhi-Yi Huang, Pooja Kulkarni et al.
· 0 citations