ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2308.08046
  4. Cited By
Regret Lower Bounds in Multi-agent Multi-armed Bandit

Regret Lower Bounds in Multi-agent Multi-armed Bandit

15 August 2023
Mengfan Xu
Diego Klabjan
ArXivPDFHTML

Papers citing "Regret Lower Bounds in Multi-agent Multi-armed Bandit"

4 / 4 papers shown
Title
Near-Optimal Collaborative Learning in Bandits
Near-Optimal Collaborative Learning in Bandits
Clémence Réda
Sattar Vakili
E. Kaufmann
FedML
30
21
0
31 May 2022
Multi-Agent Multi-Armed Bandits with Limited Communication
Multi-Agent Multi-Armed Bandits with Limited Communication
Mridul Agarwal
Vaneet Aggarwal
Kamyar Azizzadenesheli
33
32
0
10 Feb 2021
Federated Bandit: A Gossiping Approach
Federated Bandit: A Gossiping Approach
Zhaowei Zhu
Jingxuan Zhu
Ji Liu
Yang Liu
FedML
143
83
0
24 Oct 2020
Distributed Cooperative Decision Making in Multi-agent Multi-armed
  Bandits
Distributed Cooperative Decision Making in Multi-agent Multi-armed Bandits
Peter Landgren
Vaibhav Srivastava
Naomi Ehrich Leonard
74
68
0
03 Mar 2020
1