{"total":18,"rows":[{"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":"2310.18465","title":"Nearly Minimax Optimal Submodular Maximization with Bandit Feedback","created":"2023-10-27","cited_by_count":7,"area":null},{"id":"2302.06599","title":"FilFL: Client Filtering for Optimized Client Participation in Federated Learning","created":"2023-02-13","cited_by_count":5,"area":null},{"id":"2310.05093","title":"Asymmetrically Decentralized Federated Learning","created":"2023-10-08","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":"2412.10682","title":"Stochastic $k$-Submodular Bandits with Full Bandit Feedback","created":"2024-12-14","cited_by_count":3,"area":null},{"id":"2502.04290","title":"Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants","created":"2025-02-06","cited_by_count":3,"area":null},{"id":"2407.00567","title":"A Contextual Combinatorial Bandit Approach to Negotiation","created":"2024-06-30","cited_by_count":2,"area":null},{"id":"2406.06520","title":"Decentralized Personalized Federated Learning","created":"2024-06-10","cited_by_count":1,"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":"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":"2603.06810","title":"Multi-Agent Reinforcement Learning with Submodular Reward","created":"2026-03-06","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.01502","title":"Stochastic Sequential Search in Very-High-Dimensional Feature Selection","created":"2026-08-02","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}