In an adaptive bin-deletion game, uniform redistribution and two-choice yield optimal O(n) recourse and O(log log n) load after n/2 rounds, and 2-splitting suffices for linear recourse.
Modern Discrete Probability: An Essential Toolkit , DOI=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Load Balancing under Adaptive Bin Deletions
In an adaptive bin-deletion game, uniform redistribution and two-choice yield optimal O(n) recourse and O(log log n) load after n/2 rounds, and 2-splitting suffices for linear recourse.