Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 2777, 418-432
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- PAC Bounds for Multi-armed Bandit and Markov Decision Processes2002
- The Nonstochastic Multiarmed Bandit ProblemSIAM Journal on Computing, 2002
- Finite-time lower bounds for the two-armed bandit problemIEEE Transactions on Automatic Control, 2000
- Neural Network Learning1999
- Asymptotically efficient adaptive allocation rulesAdvances in Applied Mathematics, 1985
- Bandit problems1985
- ASYMPTOTICALLY OPTIMAL PROCEDURES FOR SEQUENTIAL ADAPTIVE SELECTION OF THE BEST OF SEVERAL NORMAL MEANS1982
- Some aspects of the sequential design of experimentsBulletin of the American Mathematical Society, 1952