Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem

This publication has 8 references indexed in Scilit:

• PAC Bounds for Multi-armed Bandit and Markov Decision Processes
  Published by Springer Nature ,2002
• The Nonstochastic Multiarmed Bandit Problem
  SIAM Journal on Computing, 2002
• Finite-time lower bounds for the two-armed bandit problem
  IEEE Transactions on Automatic Control, 2000
• Neural Network Learning
  Published by Cambridge University Press (CUP) ,1999
• Asymptotically efficient adaptive allocation rules
  Advances in Applied Mathematics, 1985
• Bandit problems
  Published by Springer Nature ,1985
• ASYMPTOTICALLY OPTIMAL PROCEDURES FOR SEQUENTIAL ADAPTIVE SELECTION OF THE BEST OF SEVERAL NORMAL MEANS
  Published by Elsevier ,1982
• Some aspects of the sequential design of experiments
  Bulletin of the American Mathematical Society, 1952