Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits
<|reference_start|>Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits: We consider the infinite-horizon, average-reward restless bandit problem in discrete time. We propose a new class of policies that are designed to drive a progressively larger subset of arms toward the optimal distribution. We show that our policies are asymptotically optimal with an $O(1/\sqrt{N})$ optimality gap for an $N$-armed problem, assuming only a unichain and aperiodicity assumption. Our approach departs from most existing work that focuses on index or priority policies, which rely on the Global Attractor Property (GAP) to guarantee convergence to the optimum, or a recently developed simulation-based policy, which requires a Synchronization Assumption (SA).<|reference_end|>
@article{hong2024unichain,
    title={Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of
  Average-Reward Restless Bandits},
    author={Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang},
    journal={arXiv preprint arXiv:2402.05689},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.05689},
    primaryClass={cs.LG math.OC math.PR}
}