Research map / Bandits and online learning / Multi-armed bandits
Decentralized Cooperative Stochastic 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use DDUCB (delayed accelerated-consensus UCB) instead of coopUCB | decentralized cooperative bandit · cycle and square-grid networks, 100-225 nodes | cumulative regret | Helped |
| Communicate with Chebyshev-accelerated gossip instead of unaccelerated running consensus (ablation) | DDUCB · cycle and square-grid networks | cumulative regret | Helped |
Closest papers by meaning
- Decentralized Multi-Agent Linear Bandits with Safety Constraints (AAAI 2021 · similarity 0.95)
- Decentralized Randomly Distributed Multi-agent Multi-armed Bandit with Heterogeneous Rewards (NeurIPS 2023 · similarity 0.93)
- One More Step Towards Reality: Cooperative Bandits with Imperfect Communication (NeurIPS 2021 · similarity 0.93)
- Individual Regret in Cooperative Stochastic Multi-Armed Bandits (NeurIPS 2025 · similarity 0.93)
- Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback (NeurIPS 2021 · similarity 0.93)
- Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks (NeurIPS 2025 · similarity 0.91)
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.