Online policies achieve optimal fairness of 1/(1+R_beta) for arbitrary arrivals and a tighter [1-(1-R_beta/T)^T]/R_beta bound for stationary arrivals via the RCB algorithm, with partial fulfillment required for optimality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Promoting Fair Online Resource Allocation with Indivisible Units
Online policies achieve optimal fairness of 1/(1+R_beta) for arbitrary arrivals and a tighter [1-(1-R_beta/T)^T]/R_beta bound for stationary arrivals via the RCB algorithm, with partial fulfillment required for optimality.