Robustness of stochastic bandit policies
Open Access
- 1 January 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 519, 46-67
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Exploration–exploitation tradeoff using variance estimates in multi-armed banditsTheoretical Computer Science, 2009
- When can the two-armed bandit algorithm be trusted?The Annals of Applied Probability, 2004
- Finite-time Analysis of the Multiarmed Bandit ProblemMachine Learning, 2002
- Optimal Adaptive Policies for Sequential Allocation ProblemsAdvances in Applied Mathematics, 1996
- The Tight Constant in the Dvoretzky-Kiefer-Wolfowitz InequalityThe Annals of Probability, 1990
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985
- Some aspects of the sequential design of experimentsBulletin of the American Mathematical Society, 1952