Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands
Lixing Lyu, Wang Chi Cheung

TL;DR
This paper addresses online resource allocation with non-stationary demands and bandit feedback, proposing advice-informed algorithms that outperform traditional methods and providing theoretical and numerical performance guarantees.
Contribution
It introduces a robust online algorithm leveraging demand predictions, demonstrating improved regret bounds and adaptability in non-stationary demand environments.
Findings
Advice-informed algorithms outperform non-advice methods.
Theoretical guarantees for demand scenarios with explicit examples.
Numerical results show competitive performance in revenue management.
Abstract
We consider a general online resource allocation model with bandit feedback and time-varying demands. While online resource allocation has been well studied in the literature, most existing works make the strong assumption that the demand arrival process is stationary. In practical applications, such as online advertisement and revenue management, however, this process may be exogenous and non-stationary, like the constantly changing internet traffic. Motivated by the recent Online Algorithms with Advice framework [Mitazenmacher and Vassilvitskii, \emph{Commun. ACM} 2022], we explore how online advice can inform policy design. We establish an impossibility result that any algorithm perform poorly in terms of regret without any advice in our setting. In contrast, we design an robust online algorithm that leverages the online predictions on the total demand volumes. Empowered with online…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Smart Grid Energy Management · Optimization and Search Problems
