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. 2103.13059
  4. Cited By
Towards Optimal Algorithms for Multi-Player Bandits without Collision
  Sensing Information
v1v2 (latest)

Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information

24 March 2021
Wei Huang
Richard Combes
Cindy Trinh
ArXiv (abs)PDFHTML

Papers citing "Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information"

4 / 4 papers shown
Title
Meet Me at the Arm: The Cooperative Multi-Armed Bandits Problem with Shareable Arms
Meet Me at the Arm: The Cooperative Multi-Armed Bandits Problem with Shareable Arms
Xinyi Hu
Aldo Pacchiano
52
0
0
11 Jun 2025
Allocating Divisible Resources on Arms with Unknown and Random Rewards
Allocating Divisible Resources on Arms with Unknown and Random Rewards
Ningyuan Chen
Wenhao Li
51
0
0
28 Jun 2023
The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player
  Multi-Armed Bandits with no Communication
The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication
Allen Liu
Mark Sellke
74
2
0
19 Feb 2022
An Instance-Dependent Analysis for the Cooperative Multi-Player
  Multi-Armed Bandit
An Instance-Dependent Analysis for the Cooperative Multi-Player Multi-Armed Bandit
Aldo Pacchiano
Peter L. Bartlett
Michael I. Jordan
71
6
0
08 Nov 2021
1