{"total":16,"rows":[{"id":"2111.12306","title":"Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability","created":"2021-11-24","cited_by_count":44,"area":null},{"id":"2202.04593","title":"Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models","created":"2022-02-09","cited_by_count":37,"area":null},{"id":"2111.03917","title":"Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits","created":"2021-11-06","cited_by_count":9,"area":null},{"id":"2210.02562","title":"Dueling Convex Optimization with General Preferences","created":"2022-09-27","cited_by_count":6,"area":null},{"id":"2107.02274","title":"Dueling Bandits with Adversarial Sleeping","created":"2021-07-05","cited_by_count":5,"area":null},{"id":"2202.04487","title":"Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget","created":"2022-02-09","cited_by_count":5,"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":"2211.10293","title":"Dueling Bandits: From Two-dueling to Multi-dueling","created":"2022-11-16","cited_by_count":4,"area":null},{"id":"2402.18917","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","created":"2024-02-29","cited_by_count":4,"area":null},{"id":"2210.14998","title":"One Arrow, Two Kills: An Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits","created":"2022-10-26","cited_by_count":3,"area":null},{"id":"2103.02741","title":"Combinatorial Bandits without Total Order for Arms","created":"2021-03-03","cited_by_count":1,"area":null},{"id":"2403.15045","title":"DP-Dueling: Learning from Preference Feedback without Compromising User Privacy","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2406.12475","title":"Adversarial Multi-dueling Bandits","created":"2024-06-18","cited_by_count":1,"area":null},{"id":"2107.02738","title":"Dueling Bandits with Team Comparisons","created":"2021-07-06","cited_by_count":0,"area":null},{"id":"2310.00750","title":"Identifying Copeland Winners in Dueling Bandits with Indifferences","created":"2023-10-01","cited_by_count":0,"area":null},{"id":"2603.18972","title":"Best-of-Both-Worlds Multi-Dueling Bandits: Unified Algorithms for Stochastic and Adversarial Preferences under Condorcet and Borda Objectives","created":"2026-03-19","cited_by_count":0,"area":null}],"next_cursor":null}