Fetching the paper…
Reading the bibliography…
We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem.
Some aspects of the sequential design of experiments
H. Robbins · 1952
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.
The non-stochastic multi-armed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. Schapire · 2002
Earlier work this paper cites.
Incomplete Information and Internal Regret in Prediction of Individual Sequences
G. Stoltz · 2005
Earlier work this paper cites.
From external to internal regret
A. Blum and Y. Mansour · 2007
Earlier work this paper cites.
Medium access in cognitive radio networks: A competitive multi-armed bandit framework
L. Lai, H. Jiang, and H. V. Poor · 2008
Earlier work this paper cites.
Regret minimization for online buffering problems using the weighted majority algorithm
S. Geulen, B. Vöcking, and M. Winkler · 2010
Earlier work this paper cites.
A primer on pseudorandom generators , volume 55
Oded Goldreich · 2010
Earlier work this paper cites.
Regret bounds for sleeping experts and bandits
R. Kleinberg, A. Niculescu-Mizil, and Y. Sharma · 2010
Cited alongside, same era.
Distributed learning in multi-armed bandit with multiple players
K. Liu and Q. Zhao · 2010
Cited alongside, same era.
Algorithms for adversarial bandit problems with multiple plays
T. Uchiya, A. Nakamura, and M. Kudo · 2010
Cited alongside, same era.
Distributed algorithms for learning and cognitive medium access with logarithmic regret
A. Anandkumar, N. Michael, A. K. Tang, and A. Swami · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
S. Bubeck and N. Cesa-Bianchi · 2012
Cited alongside, same era.
Combinatorial bandits
N. Cesa-Bianchi and G. Lugosi · 2012
Cited alongside, same era.
Bandits with switching costs: t 2 / 3 t^{2/3} regret
O. Dekel, J. Ding, T. Koren, and Y. Peres · 2014
Later among the works it cites.
Multi-player bandits - a musical chairs approach
J. Rosenski, O. Shamir, and L. Szlak · 2016
Later among the works it cites.
Multi-armed bandit learning in iot networks: Learning helps even in non-stationary settings
R. Bonnefoi, L. Besson, C. Moy, E. Kaufmann, and J. Palicot · 2017
Later among the works it cites.
Sic-mmab: Synchronisation involves communication in multiplayer multi-armed bandits
E. Boursier and V. Perchet · 2018
Later among the works it cites.
Multiplayer bandits without observing collision information
G. Lugosi and A. Mehrabian · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Regret in online combinatorial optimization
J.Y. Audibert, S. Bubeck, and G. Lugosi · 2014
Cited alongside, same era.
Concurrent bandits and cognitive radio networks
O. Avner and S. Mannor · 2014
Cited alongside, same era.
P. Alatur, K. Y. Levy, and A. Krause · 2019
Closest in time.
Bandit Algorithms
T. Lattimore and Cs. Szepesvári · 2019
Closest in time.