{"total":18,"rows":[{"id":"2312.08057","title":"Combinatorial Stochastic-Greedy Bandit","created":"2023-12-13","cited_by_count":18,"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":"2405.05950","title":"Federated Combinatorial Multi-Agent Multi-Armed Bandits","created":"2024-05-09","cited_by_count":11,"area":null},{"id":"2302.01377","title":"Learning with Exposure Constraints in Recommendation Systems","created":"2023-02-02","cited_by_count":8,"area":null},{"id":"2312.15427","title":"Semi-Bandit Learning for Monotone Stochastic Optimization","created":"2023-12-24","cited_by_count":8,"area":null},{"id":"2310.18465","title":"Nearly Minimax Optimal Submodular Maximization with Bandit Feedback","created":"2023-10-27","cited_by_count":7,"area":null},{"id":"2501.19300","title":"Offline Learning for Combinatorial Multi-armed Bandits","created":"2025-01-31","cited_by_count":5,"area":null},{"id":"2412.10682","title":"Stochastic $k$-Submodular Bandits with Full Bandit Feedback","created":"2024-12-14","cited_by_count":3,"area":null},{"id":"2303.13604","title":"Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback","created":"2023-03-23","cited_by_count":2,"area":null},{"id":"2405.12439","title":"No-Regret M${}^{\\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting","created":"2024-05-21","cited_by_count":1,"area":null},{"id":"2503.12285","title":"A Resilience Framework for Bi-Criteria Combinatorial Optimization with Bandit Feedback","created":"2025-03-15","cited_by_count":0,"area":null},{"id":"2510.09425","title":"Bandits with Single-Peaked Preferences and Limited Resources","created":"2025-10-10","cited_by_count":0,"area":null},{"id":"2602.16183","title":"Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2605.00762","title":"Meritocratic Fairness via $K$-Shapley Values in Budgeted Combinatorial Bandits with Full-Bandit Feedback","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2605.10151","title":"Learning to Sparsify Stochastic Linear Bandits","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2607.00680","title":"Distributed Online Bandit Submodular Maximization with Bounded Sampling Violations","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2608.12134","title":"Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning","created":"2026-08-12","cited_by_count":0,"area":null},{"id":"2608.24627","title":"Bandit Submodular Maximization under Matroid Constraints: Learning Compressed Exchange Policy","created":"2026-08-25","cited_by_count":0,"area":null}],"next_cursor":null}