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.
arXiv preprintarXiv:2508.21753(2025)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper derives threshold-structured optimal allocations and a decreasing-CV routing policy for sequential max-min fair resource allocation, then proposes the PPA-deCV heuristic and compares fairness objectives via numerical experiments.
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.
-
Sequential Fair Allocation and Routing in Nonprofit Operations
The paper derives threshold-structured optimal allocations and a decreasing-CV routing policy for sequential max-min fair resource allocation, then proposes the PPA-deCV heuristic and compares fairness objectives via numerical experiments.