mlsanityData to 7 Oct 2026

Decentralized Heterogeneous Multi-Player Multi-Armed Bandits with Non-Zero Rewards on Collisions

arXiv 1910.09089 ↗First posted 21 Oct 2019cs.LG cs.GT stat.MLcited by 10

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

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 3; 2023: 3; 2024: 1; 2025: 0; 2026: 1.

10 papers.