Research map / Bandits and online learning / Online convex optimization and games
Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use UCB-TC/UC/BA (tournament-solution selection procedures) instead of baselines BTMB, RUCB, SAVAGE-CO, CCB | dueling bandits with top cycle, uncovered set, Banks set targets · PMSLR, PTennis, PHudry | average pairwise regret relative to target tournament solution | Helped |
Closest papers by meaning
- On Weak Regret Analysis for Dueling Bandits (NeurIPS 2024 · similarity 0.92)
- Fusing Reward and Dueling Feedback in Stochastic Bandits (ICML 2025 · similarity 0.91)
- Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits (ICLR 2024 · similarity 0.90)
- The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits (NeurIPS 2026 · similarity 0.90)
- Borda Regret Minimization for Generalized Linear Dueling Bandits (ICML 2024 · similarity 0.89)
- Nash Social Welfare for Multi Armed Bandits: Trajectory-wise Expected and High Probability Regret (NeurIPS 2026 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.