Fetching the paper…
Reading the bibliography…
Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage.
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
W. R. Thompson · 1933
Earlier work this paper cites.
Some aspects of the sequential design of experiments
H. Robbins · 1952
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
T. L. Lai and H. Robbins · 1985
Earlier work this paper cites.
Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-part i: I.i.d. rewards
V. Anantharam, P. Varaiya, and J. Walrand · 1987
Earlier work this paper cites.
Sample mean based index policies with o(log n) regret for the multi-armed bandit problem
R. Agrawal · 1995
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, and P. Fischer · 2002
Earlier work this paper cites.
Multi-armed bandit based policies for cognitive radio’s decision making issues
W. Jouini, D. Ernst, C. Moy, and J. Palicot · 2009
Earlier work this paper cites.
Distributed learning in multi-armed bandit with multiple players
K. Liu and Q. Zhao · 2010
Earlier work this paper cites.
Distributed algorithms for learning and cognitive medium access with logarithmic regret
A. Anandkumar, N. Michael, A. K. Tang, and A. Swami · 2011
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
S. Bubeck and N. Cesa-Bianchi · 2012
Earlier work this paper cites.
Multiple identifications in multi-armed bandits
S. Bubeck, T. Wang, and N. Viswanathan · 2013
Cited alongside, same era.
The multi-armed bandit problem with covariates
V. Perchet and P. Rigollet · 2013
Cited alongside, same era.
Concurrent bandits and cognitive radio networks
O. Avner and S. Mannor · 2014
Cited alongside, same era.
Decentralized learning for multiplayer multiarmed bandits
D. Kalathil, N. Nayyar, and R. Jain · 2014
Cited alongside, same era.
Learning to coordinate without communication in multi-user multi-armed bandit problems
O. Avner and S. Mannor · 2015
Cited alongside, same era.
Optimal regret analysis of thompson sampling in stochastic multi-armed bandit problem with multiple plays
J. Komiyama, J. Honda, and H. Nakagawa · 2015
Multi-user communication networks: A coordinated multi-armed bandit approach
O. Avner and S. Mannor · 2018
Closest in time.
Multi-Player Bandits Revisited
L. Besson and E. Kaufmann · 2018
Closest in time.
Distributed multi-player bandits-a game of thrones approach
I. Bistritz and A. Leshem · 2018
Closest in time.
Distributed algorithm for dynamic spectrum access in infrastructure-less cognitive radio network
H. Joshi, R. Kumar, A. Yadav, and S. J. Darak · 2018
Closest in time.
Multiplayer bandits without observing collision information
G. Lugosi and A. Mehrabian · 2018
Closest in time.
A practical algorithm for multiplayer bandits when arm means vary among players
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Batched bandit problems
V. Perchet, P. Rigollet, S. Chassang, and E. Snowberg · 2015
Cited alongside, same era.
Anytime optimal algorithms in stochastic multi-armed bandits
R. Degenne and V. Perchet · 2016
Cited alongside, same era.
Multi-player bandits–a musical chairs approach
J. Rosenski, O. Shamir, and L. Szlak · 2016
Cited alongside, same era.
E. Boursier, E. Kaufmann, A. Mehrabian, and V. Perchet · 2019
Closest in time.
S. Bubeck, Y. Li, Y. Peres, and M. Sellke · 2019
Closest in time.
An optimal algorithm in multiplayer multi-armed bandits, 2019
A. Proutiere and P. Wang · 2019
Closest in time.
Distributed learning and optimal assignment in multiplayer heterogeneous networks
H. Tibrewal, S. Patchala, M.K. Hanawal, and S.J. Darak · 2019
Closest in time.