References

• 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
• 2006Prediction, Learning, and Games3,176 cited
• 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,098 cited
• 2011Analysis of Thompson Sampling for the multi-armed bandit problem904 cited
• 2011Improved Algorithms for Linear Stochastic Bandits860 cited
• 2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits571 cited
• 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
• 2012Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis381 cited
• 2009Pure Exploration in Multi-armed Bandits Problems365 cited
• 2013KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION274 cited
• 2009Interactively optimizing information retrieval systems as a dueling bandits problem268 cited
• 2012The K-armed dueling bandits problem248 cited
• 2011X -Armed Bandits205 cited
• 2011Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness145 cited
• 2012Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations