dueling bandit

Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016 Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NeurIPS 2016 Instance-dependent Regret Bounds for Dueling Bandits COLT 2016 Verification Based Solution for Structured MAB Problems NeurIPS 2016 Contextual Dueling Bandits COLT 2015 Copeland Dueling Bandits NeurIPS 2015 Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach NeurIPS 2015 Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015 Sparse Dueling Bandits AISTATS 2015 Efficient Partial Monitoring with Prior Information NeurIPS 2014 Learning Multiple Tasks in Parallel with a Shared Annotator NeurIPS 2014 Reducing Dueling Bandits to Cardinal Bandits ICML 2014 Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem ICML 2014 Generic Exploration and K-armed Voting Bandits ICML 2013