Research map / Bandits and online learning / Multi-armed bandits
Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness
Qingsong Liu, Weihang Xu, Siwei Wang, Zhixuan Fang
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Bandits with Knapsacks beyond the Worst Case (NeurIPS 2021 · similarity 0.92)
- Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints (NeurIPS 2024 · similarity 0.90)
- No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization (ICML 2025 · similarity 0.90)
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · similarity 0.90)
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.90)
- Nash Social Welfare for Multi Armed Bandits: Trajectory-wise Expected and High Probability Regret (NeurIPS 2026 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
