Affiliation:
1. Department of Statistics, Carlos III University of Madrid, 28903 Getafe, Madrid, Spain
Abstract
The restless multi-armed bandit problem is a paradigmatic modeling framework for optimal dynamic priority allocation in stochastic models of wide-ranging applications that has been widely investigated and applied since its inception in a seminal paper by Whittle in the late 1980s. The problem has generated a vast and fast-growing literature from which a significant sample is thematically organized and reviewed in this paper. While the main focus is on priority-index policies due to their intuitive appeal, tractability, asymptotic optimality properties, and often strong empirical performance, other lines of work are also reviewed. Theoretical and algorithmic developments are discussed, along with diverse applications. The main goals are to highlight the remarkable breadth of work that has been carried out on the topic and to stimulate further research in the field.
Funder
Agencia Estatal de Investigación
Comunidad de Madrid
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference206 articles.
1. Puterman, M.L. (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley.
2. A dynamic allocation index for the sequential design of experiments;Gani;Progress in Statistics, Proceedings of the European Meeting of Statisticians, Budapest, Hungary, 31 August–5 September 1972,1974
3. Restless bandits: Activity allocation in a changing world;Whittle;J. Appl. Probab.,1988
4. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples;Thompson;Biometrika,1933
5. On the theory of apportionment;Thompson;Am. J. Math.,1935
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献