Research map / Bandits and online learning / Online convex optimization and games
Cooperative Multi-player Bandit Optimization
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 |
|---|---|---|---|
| communicate sampled rewards over the graph with bias-corrected gradient estimation instead of no communication | cooperative multi-player bandit algorithm · congestion game, N=8 players, R=4 resources | sum of rewards | Helped |
Closest papers by meaning
- My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits (ICML 2020 · similarity 0.91)
- Decentralized Cooperative Stochastic Bandits (NeurIPS 2019 · similarity 0.91)
- One More Step Towards Reality: Cooperative Bandits with Imperfect Communication (NeurIPS 2021 · similarity 0.90)
- Decentralized Randomly Distributed Multi-agent Multi-armed Bandit with Heterogeneous Rewards (NeurIPS 2023 · similarity 0.90)
- Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks (NeurIPS 2025 · similarity 0.89)
- Individual Regret in Cooperative Stochastic Multi-Armed Bandits (NeurIPS 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.