Decentralized Learning for Multi-player Multi-armed Bandits
Dileep Kalathil, Naumaan Nayyar, Rahul Jain

TL;DR
This paper introduces a novel distributed online learning algorithm for multi-player multi-armed bandits, effectively managing exploration and exploitation without communication, with applications in cognitive radio networks.
Contribution
It presents the first distributed learning algorithm for multi-player MABs that achieves near-logarithmic regret without communication among players.
Findings
Expected regret grows at most as near-O(log^2 T)
The ${ t dUCB_4}$ algorithm effectively balances exploration and exploitation
Applicable to cognitive radio networks for opportunistic spectrum access
Abstract
We consider the problem of distributed online learning with multiple players in multi-armed bandits (MAB) models. Each player can pick among multiple arms. When a player picks an arm, it gets a reward. We consider both i.i.d. reward model and Markovian reward model. In the i.i.d. model each arm is modelled as an i.i.d. process with an unknown distribution with an unknown mean. In the Markovian model, each arm is modelled as a finite, irreducible, aperiodic and reversible Markov chain with an unknown probability transition matrix and stationary distribution. The arms give different rewards to different players. If two players pick the same arm, there is a "collision", and neither of them get any reward. There is no dedicated control channel for coordination or communication among the players. Any other communication between the users is costly and will add to the regret. We propose an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
