Research map / Bandits and online learning / Online convex optimization and games
Queue Up Your Regrets: Achieving the Dynamic Capacity Region of Multiplayer Bandits
Read the paperCheck your idea against 108,967 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
- Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits (NeurIPS 2019 · similarity 0.91)
- Individual Regret in Cooperative Stochastic Multi-Armed Bandits (NeurIPS 2025 · similarity 0.90)
- Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks (NeurIPS 2025 · similarity 0.90)
- Decentralized Scheduling with QoS Constraints: Achieving O(1) QoS Regret of Multi-Player Bandits (AAAI 2024 · similarity 0.89)
- Batched Stochastic Linear Bandits with 1-Bit Communication Constraints (NeurIPS 2026 · similarity 0.88)
- Delay as Payoff in MAB (AAAI 2025 · similarity 0.88)
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.