Research map / Bandits and online learning / Multi-armed bandits
Statistical and Computational Trade-off in Multi-Agent Multi-Armed 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
- Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs (AAAI 2024 · similarity 0.91)
- Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks (NeurIPS 2025 · similarity 0.90)
- Individual Regret in Cooperative Stochastic Multi-Armed Bandits (NeurIPS 2025 · similarity 0.90)
- Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits (AAAI 2024 · similarity 0.90)
- Heterogeneous Multi-Agent Bandits with Parsimonious Hints (AAAI 2025 · similarity 0.89)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · 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.