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.04314
  4. Cited By
Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal
  Individual Regret and Constant Communication Costs

Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs

8 August 2023
L. Yang
Xuchuang Wang
Mohammad Hajiesmaili
Lijun Zhang
John C. S. Lui
Don Towsley
ArXivPDFHTML

Papers citing "Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs"

5 / 5 papers shown
Title
Individual Regret in Cooperative Stochastic Multi-Armed Bandits
Individual Regret in Cooperative Stochastic Multi-Armed Bandits
Idan Barnea
Tal Lancewicki
Yishay Mansour
21
0
0
10 Nov 2024
Multi-Player Approaches for Dueling Bandits
Multi-Player Approaches for Dueling Bandits
Or Raveh
Junya Honda
Masashi Sugiyama
30
1
0
25 May 2024
Pure Exploration in Asynchronous Federated Bandits
Pure Exploration in Asynchronous Federated Bandits
Zichen Wang
Chuanhao Li
Chenyu Song
Lianghui Wang
Quanquan Gu
Huazheng Wang
FedML
25
0
0
17 Oct 2023
Distributed Bandits with Heterogeneous Agents
Distributed Bandits with Heterogeneous Agents
Lin Yang
Y. Chen
Mohammad Hajiesmaili
John C. S. Lui
Don Towsley
40
21
0
23 Jan 2022
Federated Multi-Armed Bandits
Federated Multi-Armed Bandits
Chengshuai Shi
Cong Shen
FedML
53
91
0
28 Jan 2021
1