A survey on multi-player bandits
arXiv:2211.16275
Abstract
Due mostly to its application to cognitive radio networks, multiplayer bandits gained a lot of interest in the last decade. A considerable progress has been made on its theoretical aspect. However, the current algorithms are far from applicable and many obstacles remain between these theoretical results and a possible implementation of multiplayer bandits algorithms in real cognitive radio networks. This survey contextualizes and organizes the rich multiplayer bandits literature. In light of the existing works, some clear directions for future research appear. We believe that a further study of these different directions might lead to theoretical algorithms adapted to real-world situations.
final version, accepted at JMLR
References in corpus (23)
- Distributed Learning in Multi-Armed Bandit with Multiple Players
- The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
- Combinatorial Bandits Revisited
- Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret
- Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
- Thompson Sampling for Combinatorial Semi-Bandits
- Game of Thrones: Fully Distributed Learning for Multi-Player Bandits
- Combinatorial semi-bandit with known covariance
- Bandit Learning in Decentralized Matching Markets
- Multi-Player Bandits: The Adversarial Case
- Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits
- Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits
- Decentralized Multi-player Multi-armed Bandits with No Collision Information
- Cooperative Online Learning: Keeping your Neighbors Updated
- Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits
- Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship
- Decentralized Learning in Online Queuing Systems
- Towards Optimal Algorithms for Multi-Player Bandits without Collision Sensing Information
- Distributed learning in congested environments with partial information
- An Efficient Algorithm for Cooperative Semi-Bandits
- An Instance-Dependent Analysis for the Cooperative Multi-Player Multi-Armed Bandit
- Competing for Shareable Arms in Multi-Player Multi-Armed Bandits
- Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time