A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits
Jos\'e Ni\~no-Mora

TL;DR
This paper provides a verification theorem offering sufficient conditions to establish indexability and optimal threshold policies for real-state discounted restless bandits, facilitating their analysis and application.
Contribution
It introduces a verification theorem that confirms indexability and optimal threshold policies without relying on optimal value function properties or prior threshold optimality proofs.
Findings
Provides sufficient conditions for indexability of real-state restless bandits.
Establishes that threshold policies are optimal under certain conditions.
Defines a generalized Whittle index via a marginal productivity index.
Abstract
The Whittle index, which characterizes optimal policies for controlling certain single restless bandit projects (a Markov decision process with two actions: active and passive) is the basis for a widely used heuristic index policy for the intractable restless multiarmed bandit problem. Yet two roadblocks need to be overcome to apply such a policy: the individual projects in the model at hand must be shown to be indexable, so that they possess a Whittle index; and the index must be evaluated. Such roadblocks can be especially vexing when project state spaces are real intervals, as in recent sensor scheduling applications. This paper presents sufficient conditions for indexability (relative to a generalized Whittle index) of general real-state discrete-time restless bandits under the discounted criterion, which are not based on elucidating properties of the optimal value function and do…
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.
