An asymptotically optimal policy for finite support models in the multiarmed bandit problem
- 2 July 2011
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 85 (3) , 361-391
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Convex Optimization2004
- The Nonstochastic Multiarmed Bandit ProblemSIAM Journal on Computing, 2002
- Optimal Adaptive Policies for Sequential Allocation ProblemsAdvances in Applied Mathematics, 1996
- Sample mean based index policies byO(logn) regret for the multi-armed bandit problemAdvances in Applied Probability, 1995
- The Continuum-Armed Bandit ProblemSIAM Journal on Control and Optimization, 1995
- Multi-Armed bandit problem revisitedJournal of Optimization Theory and Applications, 1994
- Nonparametric bandit methodsAnnals of Operations Research, 1991
- The Multi-Armed Bandit Problem: Decomposition and ComputationMathematics of Operations Research, 1987
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985
- Some aspects of the sequential design of experimentsBulletin of the American Mathematical Society, 1952