Brick-Laying greedy algorithm achieves majorization minimax-optimality for online equitable allocation of indivisible resources constrained to discrete polymatroid bases.
The American Mathematical Monthly , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Online Equitable Allocation with Indivisible Resources
Brick-Laying greedy algorithm achieves majorization minimax-optimality for online equitable allocation of indivisible resources constrained to discrete polymatroid bases.