No deterministic online algorithm for indivisible chores can guarantee every agent a cost below n times their maximin share, making the trivial all-to-one algorithm optimal.
Approximation al- gorithms for computing maximin share allocations.ACM Transactions on Algorithms (TALG), 13(4):52, 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lower Bound for Online MMS Assignment of Indivisible Chores
No deterministic online algorithm for indivisible chores can guarantee every agent a cost below n times their maximin share, making the trivial all-to-one algorithm optimal.