Multi-player bandits: the adversarial case
From MaRDI portal
Recommendations
Cites work
- Algorithms for adversarial bandit problems with multiple plays
- Competitive collaborative learning
- Distributed Learning in Multi-Armed Bandit With Multiple Players
- Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics
- Prediction, Learning, and Games
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Regret in online combinatorial optimization
- Some aspects of the sequential design of experiments
- The Nonstochastic Multiarmed Bandit Problem
Cited in
(9)- Noise free multi-armed bandit game
- Multi-player bandits revisited
- Algorithms for adversarial bandit problems with multiple plays
- Game of thrones: fully distributed learning for multiplayer bandits
- Multiplayer Bandits Without Observing Collision Information
- Periodic bandits and wireless network selection
- Learning Theory
- Distributed learning in congested environments with partial information
- An instance-dependent analysis for the cooperative multi-player multi-armed bandit
This page was built for publication: Multi-player bandits: the adversarial case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969138)