Derives threshold-structured Whittle index policies via Lagrangian relaxation for near-optimal age-of-information scheduling in partially observable Markov channels.
Indexability of restless bandit problems and optimality of whittle index for dynamic multichannel access,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Partially Observable Restless Bandits for Age-Optimal Scheduling over Markov Channels
Derives threshold-structured Whittle index policies via Lagrangian relaxation for near-optimal age-of-information scheduling in partially observable Markov channels.