Asymptotically optimal priority policies for indexable and nonindexable restless bandits
I. M. Verloop

TL;DR
This paper develops and proves the asymptotic optimality of a class of priority policies for controlling multi-class restless bandits, including nonindexable cases, with applications to queueing systems.
Contribution
It introduces a unified class of priority policies that are asymptotically optimal for both indexable and nonindexable restless bandits, extending previous results to more complex settings.
Findings
Proves asymptotic optimality of the proposed policies under certain conditions.
Shows Whittle's index policy is included in the class for indexable bandits.
Numerical evidence indicates near-optimal performance outside the asymptotic regime.
Abstract
We study the asymptotic optimal control of multi-class restless bandits. A restless bandit is a controllable stochastic process whose state evolution depends on whether or not the bandit is made active. Since finding the optimal control is typically intractable, we propose a class of priority policies that are proved to be asymptotically optimal under a global attractor property and a technical condition. We consider both a fixed population of bandits as well as a dynamic population where bandits can depart and arrive. As an example of a dynamic population of bandits, we analyze a multi-class queue for which we show asymptotic optimality of an index policy. We combine fluid-scaling techniques with linear programming results to prove that when bandits are indexable, Whittle's index policy is included in our class of priority policies. We thereby generalize a result of…
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 · Healthcare Operations and Scheduling Optimization
