{"total":38,"rows":[{"id":"2301.13326","title":"A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2312.08057","title":"Combinatorial Stochastic-Greedy Bandit","created":"2023-12-13","cited_by_count":18,"area":null},{"id":"2210.06846","title":"An $\\alpha$-regret analysis of Adversarial Bilateral Trade","created":"2022-10-13","cited_by_count":16,"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":"2305.16671","title":"A Unified Approach for Maximizing Continuous DR-submodular Functions","created":"2023-05-26","cited_by_count":10,"area":null},{"id":"2405.00065","title":"From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization","created":"2024-04-27","cited_by_count":9,"area":null},{"id":"2312.15427","title":"Semi-Bandit Learning for Monotone Stochastic Optimization","created":"2023-12-24","cited_by_count":8,"area":null},{"id":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7,"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":"2309.04339","title":"Online Submodular Maximization via Online Convex Optimization","created":"2023-09-08","cited_by_count":6,"area":null},{"id":"2305.17402","title":"Learning and Collusion in Multi-unit Auctions","created":"2023-05-27","cited_by_count":5,"area":null},{"id":"2312.12794","title":"Bandit Sequential Posted Pricing via Half-Concavity","created":"2023-12-20","cited_by_count":5,"area":null},{"id":"2403.10063","title":"Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization","created":"2024-03-15","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":"2210.08268","title":"Product Ranking for Revenue Maximization with Multiple Purchases","created":"2022-10-15","cited_by_count":3,"area":null},{"id":"2307.15193","title":"Learning in Repeated Multi-Unit Pay-As-Bid Auctions","created":"2023-07-27","cited_by_count":3,"area":null},{"id":"2311.05975","title":"Sum-max Submodular Bandits","created":"2023-11-10","cited_by_count":3,"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":"2112.02165","title":"On Submodular Contextual Bandits","created":"2021-12-03","cited_by_count":2,"area":null},{"id":"2208.03346","title":"Active Learning for Non-Parametric Choice Models","created":"2022-08-05","cited_by_count":2,"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":"2402.14013","title":"Misalignment, Learning, and Ranking: Harnessing Users Limited Attention","created":"2024-02-21","cited_by_count":1,"area":null},{"id":"2405.11397","title":"Preparing for Black Swans: The Antifragility Imperative for Machine Learning","created":"2024-05-18","cited_by_count":1,"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":"2406.00914","title":"Wasserstein gradient flow for optimal probability measure decomposition","created":"2024-06-03","cited_by_count":1,"area":null},{"id":"2510.21128","title":"A Unified Approach to Submodular Maximization Under Noise","created":"2025-10-24","cited_by_count":1,"area":null},{"id":"2602.09502","title":"Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions","created":"2026-02-10","cited_by_count":1,"area":null},{"id":"2602.13506","title":"$\\gamma$-weakly $\\theta$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2303.03327","title":"Tight Bounds for $\\gamma$-Regret via the Decision-Estimation Coefficient","created":"2023-03-06","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":"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.19480","title":"Online Two-Stage Submodular Maximization","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2601.00933","title":"LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection","created":"2026-01-02","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":"2604.09423","title":"Offline Local Search for Online Stochastic Bandits","created":"2026-04-10","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":"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}