{"total":21,"rows":[{"id":"2112.14368","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","created":"2021-12-29","cited_by_count":66,"area":null},{"id":"2106.04117","title":"The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition","created":"2021-06-08","cited_by_count":40,"area":null},{"id":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24,"area":null},{"id":"2202.06151","title":"Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits","created":"2022-02-12","cited_by_count":22,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","cited_by_count":15,"area":null},{"id":"2105.14260","title":"Understanding Bandits with Graph Feedback","created":"2021-05-29","cited_by_count":14,"area":null},{"id":"2302.08631","title":"Practical Contextual Bandits with Feedback Graphs","created":"2023-02-17","cited_by_count":11,"area":null},{"id":"2410.03284","title":"uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs","created":"2024-10-04","cited_by_count":8,"area":null},{"id":"2402.08127","title":"Efficient Contextual Bandits with Uninformed Feedback Graphs","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2210.01376","title":"Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs","created":"2022-10-04","cited_by_count":5,"area":null},{"id":"2107.09572","title":"Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs","created":"2021-07-20","cited_by_count":4,"area":null},{"id":"2608.04149","title":"Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization","created":"2026-08-04","cited_by_count":4,"area":null},{"id":"2206.10022","title":"Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality","created":"2022-06-20","cited_by_count":3,"area":null},{"id":"2505.20010","title":"Data-Dependent Regret Bounds for Constrained MABs","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2307.03641","title":"Online Network Source Optimization with Graph-Kernel MAB","created":"2023-07-07","cited_by_count":1,"area":null},{"id":"2406.10686","title":"Graph Neural Thompson Sampling","created":"2024-06-15","cited_by_count":1,"area":null},{"id":"2306.08320","title":"Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2405.06480","title":"Incentive-compatible Bandits: Importance Weighting No More","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2602.06404","title":"Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2602.09457","title":"From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2608.15996","title":"Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}