arXiv stat.ML
· Papers
Online Fair Allocation of Perishable Resources
arXiv:2406.02402v3 Announce Type: replace-cross Abstract: We consider a practically motivated variant of the canonical online fair allocation problem: a decision-maker has a budget of perishable resources to allocate over a fixed number of rounds. Each round sees a random number of arrivals, and the decision-maker must