{"total":41,"rows":[{"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":"2303.17110","title":"Contextual Combinatorial Bandits with Probabilistically Triggered Arms","created":"2023-03-30","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":"2305.12402","title":"Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits","created":"2023-05-21","cited_by_count":13,"area":null},{"id":"2105.04373","title":"Combinatorial Multi-armed Bandits for Resource Allocation","created":"2021-05-10","cited_by_count":10,"area":null},{"id":"2203.12577","title":"Minimax Regret for Cascading Bandits","created":"2022-03-23","cited_by_count":10,"area":null},{"id":"2111.04295","title":"The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle","created":"2021-11-08","cited_by_count":7,"area":null},{"id":"2402.01400","title":"Query-Efficient Correlation Clustering with Noisy Oracle","created":"2024-02-02","cited_by_count":7,"area":null},{"id":"2106.05065","title":"Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning","created":"2021-06-09","cited_by_count":6,"area":null},{"id":"2302.11182","title":"When Combinatorial Thompson Sampling meets Approximation Regret","created":"2023-02-22","cited_by_count":6,"area":null},{"id":"2501.19300","title":"Offline Learning for Combinatorial Multi-armed Bandits","created":"2025-01-31","cited_by_count":5,"area":null},{"id":"2503.07555","title":"Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference","created":"2025-03-10","cited_by_count":5,"area":null},{"id":"2105.10625","title":"Combinatorial Blocking Bandits with Stochastic Delays","created":"2021-05-22","cited_by_count":3,"area":null},{"id":"2305.16074","title":"Combinatorial Bandits for Maximum Value Reward Function under Max Value-Index Feedback","created":"2023-05-25","cited_by_count":3,"area":null},{"id":"2410.17075","title":"Combinatorial Logistic Bandits","created":"2024-10-22","cited_by_count":3,"area":null},{"id":"2102.00321","title":"Recurrent Submodular Welfare and Matroid Blocking Bandits","created":"2021-01-30","cited_by_count":2,"area":null},{"id":"2302.06916","title":"Effective Dimension in Bandit Problems under Censorship","created":"2023-02-14","cited_by_count":2,"area":null},{"id":"2305.15428","title":"Online Influence Maximization under Decreasing Cascade Model","created":"2023-05-19","cited_by_count":2,"area":null},{"id":"2310.05308","title":"Adversarial Attacks on Combinatorial Multi-Armed Bandits","created":"2023-10-08","cited_by_count":2,"area":null},{"id":"2512.21925","title":"Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Arms","created":"2025-12-26","cited_by_count":2,"area":null},{"id":"2109.02519","title":"Online Learning of Independent Cascade Models with Node-level Feedback","created":"2021-09-06","cited_by_count":1,"area":null},{"id":"2109.06077","title":"Online Influence Maximization under the Independent Cascade Model with Node-Level Feedback","created":"2021-09-13","cited_by_count":1,"area":null},{"id":"2206.14846","title":"Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization","created":"2022-06-29","cited_by_count":1,"area":null},{"id":"2208.10627","title":"Targeted Advertising on Social Networks Using Online Variational Tensor Regression","created":"2022-08-22","cited_by_count":1,"area":null},{"id":"2307.14138","title":"Piecewise-Stationary Combinatorial Semi-Bandit with Causally Related Rewards","created":"2023-07-26","cited_by_count":1,"area":null},{"id":"2308.02734","title":"Learning to Schedule in Non-Stationary Wireless Networks With Unknown Statistics","created":"2023-08-04","cited_by_count":1,"area":null},{"id":"2407.15439","title":"Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays","created":"2024-07-22","cited_by_count":1,"area":null},{"id":"2505.22254","title":"A Unified Online-Offline Framework for Co-Branding Campaign Recommendations","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2509.15515","title":"LLM Cache Bandit Revisited: Addressing Query Heterogeneity for Cost-Effective LLM Inference","created":"2025-09-19","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":"2106.03546","title":"On Learning to Rank Long Sequences with Contextual Bandits","created":"2021-06-07","cited_by_count":0,"area":null},{"id":"2109.11909","title":"Learning to maximize global influence from local observations","created":"2021-09-24","cited_by_count":0,"area":null},{"id":"2305.19691","title":"Constant or logarithmic regret in asynchronous multiplayer bandits","created":"2023-05-31","cited_by_count":0,"area":null},{"id":"2312.00099","title":"Online Influence Maximization: Concept and Algorithm","created":"2023-11-30","cited_by_count":0,"area":null},{"id":"2501.18560","title":"Bandits with Anytime Knapsacks","created":"2025-01-30","cited_by_count":0,"area":null},{"id":"2502.13467","title":"On the Sublinear Regret of Continuous K-Max Bandits","created":"2025-02-19","cited_by_count":0,"area":null},{"id":"2508.06247","title":"Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits","created":"2025-08-08","cited_by_count":0,"area":null},{"id":"2509.09933","title":"Multi-Play Combinatorial Semi-Bandit Problem","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2511.03074","title":"Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach","created":"2025-11-04","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":"2610.18514","title":"Approximating Optimal Policies in Heterogeneous Asynchronous Multi-player Bandits","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}