Brick-Laying greedy algorithm achieves majorization minimax-optimality for online equitable allocation of indivisible resources constrained to discrete polymatroid bases.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
The class of finite regular tournaments is cofinal in the class of finite tournaments, with additional cofinality results for subclasses and an explicit construction algorithm.
Survey of taxicab distance mean functions with applications to geometric tomography and Maple implementations.
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.