{"total":12,"rows":[{"id":"2202.10660","title":"Batched Dueling Bandits","created":"2022-02-22","cited_by_count":10,"area":null},{"id":"2202.00935","title":"Non-Stationary Dueling Bandits","created":"2022-02-02","cited_by_count":7,"area":null},{"id":"2202.06694","title":"Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2302.06595","title":"When Can We Track Significant Preference Shifts in Dueling Bandits?","created":"2023-02-13","cited_by_count":5,"area":null},{"id":"2508.16487","title":"FraPPE: Fast and Efficient Preference-based Pure Exploration","created":"2025-08-22","cited_by_count":4,"area":null},{"id":"2408.14603","title":"Biased Dueling Bandits with Stochastic Delayed Feedback","created":"2024-08-26","cited_by_count":3,"area":null},{"id":"2209.12108","title":"An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem","created":"2022-09-25","cited_by_count":2,"area":null},{"id":"2405.16168","title":"Multi-Player Approaches for Dueling Bandits","created":"2024-05-25","cited_by_count":2,"area":null},{"id":"2604.00523","title":"Lipschitz Dueling Bandits over Continuous Action Spaces","created":"2026-04-01","cited_by_count":1,"area":null},{"id":"2606.01799","title":"Tree-Guided Identify-Then-Exploit: A Unified Framework of Best Arm Identification and Regret Minimization for Dueling Bandits","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2609.15248","title":"Bandits with Probing: Optimal Regret and the Limits of Winner Feedback","created":"2026-09-14","cited_by_count":0,"area":null},{"id":"2609.39351","title":"On the Complexity of Preference-Based Bandits","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}