References

• 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
• 1952Some aspects of the sequential design of experiments2,183 cited
• 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,275 cited
• 2009Interactively optimizing information retrieval systems as a dueling bandits problem268 cited
• 2012The K-armed dueling bandits problem248 cited
• 1985Some Aspects of the Sequential Design of Experiments155 cited
• 2006Regret Minimization Under Partial Monitoring138 cited
• 2014Reducing Dueling Bandits to Cardinal Bandits97 cited
• 2018Stagewise Safe Bayesian Optimization with Gaussian Processes88 cited
• 2017Online Learning to Rank in Stochastic Click Models56 cited
• 2013Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem53 cited
• 2013Generic Exploration and K-armed Voting Bandits44 cited
• 2017Preferential Bayesian Optimization43 cited
• 2016Double Thompson Sampling for Dueling Bandits40 cited
• 2015Online rank elicitation for Plackett-Luce: a dueling bandits approach39 cited
• 2014A Survey of Preference-Based Online Learning with Bandit Algorithms