mlsanityData to 14 Oct 2026

On Distributed Cooperative Decision-Making in Multiarmed Bandits

arXiv 1512.06888 ↗First posted 21 Dec 2015eess.SY cs.MA cs.SYcited by 33

Not on the map. Why?

Abstract (arXiv)

We study the explore-exploit tradeoff in distributed cooperative decision-making using the context of the multiarmed bandit (MAB) problem. For the distributed cooperative MAB problem, we design the cooperative UCB algorithm that comprises two interleaved distributed processes: (i) running consensus algorithms for estimation of rewards, and (ii) upper-confidence-bound-based heuristics for selection of arms. We rigorously analyze the performance of the cooperative UCB algorithm and characterize the influence of communication graph structure on the decision-making performance of the group.

Key facts. Cited by 33 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Dec 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 9; 2022: 7; 2023: 7; 2024: 4; 2025: 3; 2026: 3.

33 papers.

Sort:

By area:

  1. 2021Federated Multi-armed Bandits with Personalizationcited by 62
  2. 2021Federated Linear Contextual Banditscited by 61
  3. 2021Federated Multi-Armed Banditscited by 59
  4. 2022A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Banditscited by 28
  5. 2021Provably Efficient Cooperative Multi-Agent Reinforcement Learning with Function Approximationcited by 23
  6. 2022A survey on multi-player banditscited by 19
  7. 2021One More Step Towards Reality: Cooperative Bandits with Imperfect Communicationcited by 15
  8. 2022Distributed Contextual Linear Bandits with Minimax Optimal Communication Costcited by 13
  9. 2023Decentralized Randomly Distributed Multi-agent Multi-armed Bandit with Heterogeneous Rewardscited by 11
  10. 2022Private and Byzantine-Proof Cooperative Decision-Makingcited by 10
  11. 2021Multi-player Multi-armed Bandits with Collision-Dependent Reward Distributionscited by 8
  12. 2021When to Call Your Neighbor? Strategic Communication in Cooperative Stochastic Banditscited by 8
21 more
  1. 2022Distributed Linear Bandits under Communication Constraintscited by 8
  2. 2024Linear Contextual Bandits with Interferencecited by 8
  3. 2022Federated Multi-Armed Bandits Under Byzantine Attackscited by 6
  4. 2022Collaborative Learning in Kernel-based Bandits for Distributed Userscited by 6
  5. 2021Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptionscited by 5
  6. 2021Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Banditscited by 3
  7. 2023Incentivized Communication for Federated Banditscited by 3
  8. 2023Byzantine-Resilient Decentralized Multi-Armed Banditscited by 3
  9. 2025Multiplayer Information Asymmetric Bandits in Metric Spacescited by 3
  10. 2025Multiplayer Information Asymmetric Contextual Banditscited by 3
  11. 2024Incentivized Truthful Communication for Federated Banditscited by 2
  12. 2023Regret Lower Bounds in Multi-agent Multi-armed Banditcited by 1
  13. 2023Harnessing the Power of Federated Learning in Federated Contextual Banditscited by 1
  14. 2024Decentralized Blockchain-based Robust Multi-agent Multi-armed Banditcited by 1
  15. 2026Laplacian Kernelized Banditcited by 1
  16. 2026Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimizationcited by 1
  17. 2023Constant or logarithmic regret in asynchronous multiplayer banditscited by 0
  18. 2023Distributed Optimization via Kernelized Multi-armed Banditscited by 0
  19. 2024Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomnesscited by 0
  20. 2025Distributed Multi-Agent Bandits Over ErdHos-R'enyi Random Networkscited by 0
  21. 2026Bandit Learning in General Open Multi-agent Systemscited by 0