{"total":14,"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":"2302.01324","title":"Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback","created":"2023-02-02","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":"2405.05950","title":"Federated Combinatorial Multi-Agent Multi-Armed Bandits","created":"2024-05-09","cited_by_count":11,"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":"2207.03091","title":"Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback","created":"2022-07-07","cited_by_count":1,"area":null},{"id":"2407.02601","title":"Linear Submodular Maximization with Bandit Feedback","created":"2024-07-02","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":"2209.14222","title":"Online Subset Selection using $\\alpha$-Core with no Augmented Regret","created":"2022-09-28","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":"2507.18756","title":"Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation","created":"2025-07-24","cited_by_count":0,"area":null},{"id":"2603.06810","title":"Multi-Agent Reinforcement Learning with Submodular Reward","created":"2026-03-06","cited_by_count":0,"area":null},{"id":"2608.16375","title":"Multinomial Subset Routing with Sum-Max Rewards and Operational Constraints","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}