Decentralized Heterogeneous Multi-Player Multi-Armed Bandits with Non-Zero Rewards on Collisions
Not on the map. Why?
Abstract (arXiv)
We consider a fully decentralized multi-player stochastic multi-armed bandit setting where the players cannot communicate with each other and can observe only their own actions and rewards. The environment may appear differently to different players, textiti.e., the reward distributions for a given arm are heterogeneous across players. In the case of a collision (when more than one player plays the same arm), we allow for the colliding players to receive non-zero rewards. The time-horizon T for which the arms are played is not known to the players. Within this setup, where the number of players is allowed to be greater than the number of arms, we present a policy that achieves near order-optimal expected regret of order O(log1 + δ T) for some 0 < δ < 1 over a time-horizon of duration T. This paper is accepted at IEEE Transactions on Information Theory.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
10 papers.
- 2021Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Informationcited by 11
- 2022Multi-Player Multi-Armed Bandits with Finite Shareable Resources Arms: Learning Algorithms & Applicationscited by 10
- 2022Distributed Bandits with Heterogeneous Agentscited by 9
- 2022Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Armscited by 6
- 2023Competing for Shareable Arms in Multi-Player Multi-Armed Banditscited by 6
- 2021Decentralized Task Offloading in Edge Computing: A Multi-User Multi-Armed Bandit Approachcited by 5
- 2023Decentralized Adversarial Training over Graphscited by 3
- 2023Decentralized Online Learning in Task Assignment Games for Mobile Crowdsensingcited by 1
- 2024PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creatorscited by 0
- 2026Cost of Structural Learning Under Censored Feedback: A Threshold-Bandit Approachcited by 0
- 2026Cost of Structural Learning Under Censored Feedback: A Threshold-Bandit Approach26 May 2026
- 2024PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators22 Mar 2024
- 2023Decentralized Online Learning in Task Assignment Games for Mobile Crowdsensing19 Sep 2023
- 2023Competing for Shareable Arms in Multi-Player Multi-Armed Bandits30 May 2023
- 2023Decentralized Adversarial Training over Graphs23 Mar 2023
- 2022Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms17 Jun 2022
- 2022Multi-Player Multi-Armed Bandits with Finite Shareable Resources Arms: Learning Algorithms & Applications28 Apr 2022
- 2022Distributed Bandits with Heterogeneous Agents23 Jan 2022
- 2021Decentralized Task Offloading in Edge Computing: A Multi-User Multi-Armed Bandit Approach22 Dec 2021
- 2021Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information24 Mar 2021