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. 2011.03896
  4. Cited By
Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal
  Regret With Neither Communication Nor Collisions

Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions

8 November 2020
Sébastien Bubeck
Thomas Budzinski
Mark Sellke
ArXivPDFHTML

Papers citing "Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions"

2 / 2 papers shown
Title
Counterfactual Multi-player Bandits for Explainable Recommendation Diversification
Counterfactual Multi-player Bandits for Explainable Recommendation Diversification
Yansen Zhang
Bowei He
Xiaokun Zhang
Haolun Wu
Zexu Sun
Chen Ma
116
1
0
27 May 2025
Coordination without communication: optimal regret in two players
  multi-armed bandits
Coordination without communication: optimal regret in two players multi-armed bandits
Sébastien Bubeck
Thomas Budzinski
53
23
0
14 Feb 2020
1