{"total":18,"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":"2208.09837","title":"Comparison-based Conversational Recommender System with Relative Bandit Feedback","created":"2022-08-21","cited_by_count":12,"area":null},{"id":"2202.10660","title":"Batched Dueling Bandits","created":"2022-02-22","cited_by_count":10,"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":"2412.03727","title":"Online Experimental Design With Estimation-Regret Trade-off Under Network Interference","created":"2024-12-04","cited_by_count":9,"area":null},{"id":"2210.14322","title":"ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits","created":"2022-10-25","cited_by_count":8,"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":"2501.19300","title":"Offline Learning for Combinatorial Multi-armed Bandits","created":"2025-01-31","cited_by_count":5,"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":"2312.17229","title":"Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources","created":"2023-12-28","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":"2603.19221","title":"Online Learning and Equilibrium Computation with Ranking Feedback","created":"2026-03-19","cited_by_count":2,"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":"2510.07646","title":"Design-Based Bandits Under Network Interference: Trade-Off Between Regret and Statistical Inference","created":"2025-10-09","cited_by_count":1,"area":null},{"id":"2602.24231","title":"Adaptive Combinatorial Experimental Design: Pareto Optimality for Decision-Making and Inference","created":"2026-02-27","cited_by_count":0,"area":null}],"next_cursor":null}