{"total":23,"rows":[{"id":"2211.16275","title":"A survey on multi-player bandits","created":"2022-11-29","cited_by_count":19,"area":null},{"id":"2110.14622","title":"Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization","created":"2021-10-27","cited_by_count":18,"area":null},{"id":"2208.14837","title":"Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms","created":"2022-08-31","cited_by_count":15,"area":null},{"id":"2206.00494","title":"Incentivizing Combinatorial Bandit Exploration","created":"2022-06-01","cited_by_count":9,"area":null},{"id":"2101.01086","title":"Be Greedy in Multi-Armed Bandits","created":"2021-01-04","cited_by_count":7,"area":null},{"id":"2302.11182","title":"When Combinatorial Thompson Sampling meets Approximation Regret","created":"2023-02-22","cited_by_count":6,"area":null},{"id":"2102.05502","title":"On the Suboptimality of Thompson Sampling in High Dimensions","created":"2021-02-10","cited_by_count":4,"area":null},{"id":"2102.07254","title":"Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time","created":"2021-02-14","cited_by_count":4,"area":null},{"id":"2108.00230","title":"Pure Exploration and Regret Minimization in Matching Bandits","created":"2021-07-31","cited_by_count":4,"area":null},{"id":"2104.08615","title":"Conservative Contextual Combinatorial Cascading Bandit","created":"2021-04-17","cited_by_count":3,"area":null},{"id":"2402.15171","title":"Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits","created":"2024-02-23","cited_by_count":3,"area":null},{"id":"2405.17968","title":"Matroid Semi-Bandits in Sublinear Time","created":"2024-05-28","cited_by_count":3,"area":null},{"id":"2102.12090","title":"Continuous Mean-Covariance Bandits","created":"2021-02-24","cited_by_count":2,"area":null},{"id":"2206.04091","title":"Uplifting Bandits","created":"2022-06-08","cited_by_count":2,"area":null},{"id":"2410.05441","title":"Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox","created":"2024-10-07","cited_by_count":1,"area":null},{"id":"2604.13738","title":"Covariance-adapting algorithm for semi-bandits with application to sparse rewards","created":"2026-04-15","cited_by_count":1,"area":null},{"id":"2208.01511","title":"Unimodal Mono-Partite Matching in a Bandit Setting","created":"2022-08-02","cited_by_count":0,"area":null},{"id":"2410.08578","title":"Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit","created":"2024-10-11","cited_by_count":0,"area":null},{"id":"2510.21431","title":"Oracle-Efficient Combinatorial Semi-Bandits","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2511.07504","title":"Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids","created":"2025-11-10","cited_by_count":0,"area":null},{"id":"2512.00605","title":"Efficient Matroid Bandit Linear Optimization Leveraging Unimodality","created":"2025-11-29","cited_by_count":0,"area":null},{"id":"2604.19672","title":"Budgeted Online Influence Maximization","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2605.09277","title":"Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits","created":"2026-05-10","cited_by_count":0,"area":null}],"next_cursor":null}