Fetching the paper…
Reading the bibliography…
We study agents communicating over an underlying network by exchanging messages, in order to optimize their individual regret in a common nonstochastic multi-armed bandit problem.
Cooperative online learning: Keeping your neighbors updated
Nicolò Cesa-Bianchi, Tommaso R Cesari, and Claire Monteleoni · 1901
Earlier work this paper cites.
A lower bound on the stability number of a simple graph
VK Wei · 1981
Earlier work this paper cites.
A fast and simple randomized parallel algorithm for the maximal independent set problem
Noga Alon, László Babai, and Alon Itai · 1986
Earlier work this paper cites.
A simple parallel algorithm for the maximal independent set problem
Michael Luby · 1986
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E Schapire · 2002
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gabor Lugosi · 2006
Earlier work this paper cites.
Competitive collaborative learning
Baruch Awerbuch and Robert Kleinberg · 2008
Earlier work this paper cites.
Bandit problems in networks: Asymptotically efficient distributed allocation rules
Soummya Kar, H Vincent Poor, and Shuguang Cui · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck, Nicolo Cesa-Bianchi, et al · 2012
Cited alongside, same era.
Gossip-based distributed stochastic bandit algorithms
Balázs Szörényi, Róbert Busa-Fekete, István Hegedűs, Róbert Ormándi, Márk Jelasity, and Balázs Kégl · 2013
Cited alongside, same era.
Concurrent bandits and cognitive radio networks
Orly Avner and Shie Mannor · 2014
Cited alongside, same era.
Prediction with limited advice and multiarmed bandits with paid observations
Yevgeny Seldin, Peter L Bartlett, Koby Crammer, and Yasin Abbasi-Yadkori · 2014
Cited alongside, same era.
On distributed cooperative decision-making in multiarmed bandits
Peter Landgren, Vaibhav Srivastava, and Naomi Ehrich Leonard · 2016
Distributed cooperative decision-making in multiarmed bandits: Frequentist and bayesian algorithms
Peter Landgren, Vaibhav Srivastava, and Naomi Ehrich Leonard · 2016
Later among the works it cites.
Multi-player bandits–a musical chairs approach
Jonathan Rosenski, Ohad Shamir, and Liran Szlak · 2016
Later among the works it cites.
Dist-hedge: A partial information setting based distributed non-stochastic sequence prediction algorithm
Anit Kumar Sahu and Soummya Kar · 2017
Later among the works it cites.
Distributed multi-player bandits-a game of thrones approach
Ilai Bistritz and Amir Leshem · 2018
Later among the works it cites.
Collaborative learning of stochastic bandits over a social network
Ravi Kumar Kolla, Krishna Jagannathan, and Aditya Gopalan · 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…
Cited alongside, same era.
Delay and cooperation in nonstochastic bandits
Nicolo Cesa-Bianchi, Claudio Gentile, and Yishay Mansour
Cited in the paper.
Pragnya Alatur, Kfir Y Levy, and Andreas Krause · 2019
Closest in time.