@inproceedings{chen2018community,
  title={Community Exploration: From Offline Optimization to Online Learning},
  author={Chen, Xiaowei and Huang, Weiran and Chen, Wei and Lui, John CS},
  booktitle={Advances in Neural Information Processing Systems},
  pages={5474--5483},
  year={2018}
}

@article{campbell2013word,
	title={Word-of-mouth communication and percolation in social networks},
	author={Campbell, Arthur},
	journal={American Economic Review},
	volume={103},
	number={6},
	pages={2466--98},
	year={2013}
}
@inproceedings{gjoka2010walking,
	title={Walking in facebook: A case study of unbiased sampling of osns},
	author={Gjoka, Minas and Kurant, Maciej and Butts, Carter T and Markopoulou, Athina},
	booktitle={2010 Proceedings IEEE Infocom},
	pages={1--9},
	year={2010},
	organization={Ieee}
}
@inproceedings{wang2017improving,
	title={Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications},
	author={Wang, Qinshi and Chen, Wei},
	booktitle={Advances in Neural Information Processing Systems},
	pages={1161--1171},
	year={2017}
}
@book{dubhashi2009concentration,
	title={Concentration of measure for the analysis of randomized algorithms},
	author={Dubhashi, Devdatt P and Panconesi, Alessandro},
	year={2009},
	publisher={Cambridge University Press}
}
@article{murty1987some,
	title={Some NP-complete problems in quadratic and nonlinear programming},
	author={Murty, Katta G and Kabadi, Santosh N},
	journal={Mathematical programming},
	volume={39},
	number={2},
	pages={117--129},
	year={1987},
	publisher={Springer}
}
@book{kijima1997markov,
	title={Markov processes for stochastic modeling},
	author={Kijima, Masaaki},
	volume={6},
	year={1997},
	publisher={CRC Press}
}
@article{chung2012chernoff,
	title={Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified},
	author={Chung, Kai-Min and Lam, Henry and Liu, Zhenming and Mitzenmacher, Michael},
	journal={arXiv preprint arXiv:1201.0559},
	year={2012}
}
@inproceedings{kveton2015tight,
	title={Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits.},
	author={Kveton, Branislav and Wen, Zheng and Ashkan, Azin and Szepesvari, Csaba},
	booktitle={AISTATS},
	year={2015}
}
@article{donsker1979number,
	title={On the number of distinct sites visited by a random walk},
	author={Donsker, MD and Varadhan, SRS},
	journal={Communications on Pure and Applied Mathematics},
	volume={32},
	number={6},
	pages={721--747},
	year={1979},
	publisher={Wiley Online Library}
}
@article{de2015average,
	title={The average number of distinct sites visited by a random walker on random graphs},
	author={De Bacco, Caterina and Majumdar, Satya N and Sollich, Peter},
	journal={Journal of Physics A: Mathematical and Theoretical},
	volume={48},
	number={20},
	pages={205004},
	year={2015},
	publisher={IOP Publishing}
}
@inproceedings{soma2014optimal,
	title={Optimal budget allocation: Theoretical guarantee and efficient algorithm},
	author={Soma, Tasuku and Kakimura, Naonori and Inaba, Kazuhiro and Kawarabayashi, Ken-ichi},
	booktitle={International Conference on Machine Learning},
	pages={351--359},
	year={2014}
}
@article{gai2012combinatorial,
	title={Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations},
	author={Gai, Yi and Krishnamachari, Bhaskar and Jain, Rahul},
	journal={IEEE/ACM Transactions on Networking (TON)},
	volume={20},
	number={5},
	pages={1466--1478},
	year={2012},
	publisher={IEEE Press}
}
@inproceedings{leskovec2012learning,
	title={Learning to discover social circles in ego networks},
	author={Leskovec, Jure and Mcauley, Julian J},
	booktitle={Advances in neural information processing systems},
	pages={539--547},
	year={2012}
}
@incollection{Kar72,
	added-at = {2006-11-06T22:06:28.000+0100},
	author = {Karp, R.},
	biburl = {https://www.bibsonomy.org/bibtex/21fa7a672ce72ed916311dc52e5a93038/lysander07},
	booktitle = {Complexity of Computer Computations},
	editor = {Miller, R. and Thatcher, J.},
	interhash = {427e5bfc8069f94f57c5d43b6fd85949},
	intrahash = {1fa7a672ce72ed916311dc52e5a93038},
	keywords = {imported XMLTage2006-2},
	pages = {85--103},
	publisher = {Plenum Press},
	timestamp = {2009-01-27T15:24:50.000+0100},
	title = {Reducibility among combinatorial problems},
	year = 1972
}
@article{nazi2015walk,
	title={Walk, not wait: Faster sampling over online social networks},
	author={Nazi, Azade and Zhou, Zhuojie and Thirumuruganathan, Saravanan and Zhang, Nan and Das, Gautam},
	journal={Proceedings of the VLDB Endowment},
	volume={8},
	number={6},
	pages={678--689},
	year={2015},
	publisher={VLDB Endowment}
}

@article{chen2016combinatorial,
  title={Combinatorial multi-armed bandit and its extension to probabilistically triggered arms},
  author={Chen, Wei and Wang, Yajun and Yuan, Yang and Wang, Qinshi},
  journal={The Journal of Machine Learning Research},
  volume={17},
  number={1},
  pages={1746--1778},
  year={2016},
  publisher={JMLR. org}
}
@article{krause2008efficient,
  title={Efficient sensor placement optimization for securing large water distribution networks},
  author={Krause, Andreas and Leskovec, Jure and Guestrin, Carlos and VanBriesen, Jeanne and Faloutsos, Christos},
  journal={Journal of Water Resources Planning and Management},
  volume={134},
  number={6},
  pages={516--526},
  year={2008},
  publisher={American Society of Civil Engineers}
}
@inproceedings{hatano2016adaptive,
  title={Adaptive Budget Allocation for Maximizing Influence of Advertisements.},
  author={Hatano, Daisuke and Fukunaga, Takuro and Kawarabayashi, Ken-Ichi}
}
@article{zhao2019stochastic,
  title={Stochastic One-Sided Full-Information Bandit},
  author={Zhao, Haoyu and Chen, Wei},
  journal={arXiv preprint arXiv:1906.08656},
  year={2019}
}
@article{cesa2017algorithmic,
  title={Algorithmic chaining and the role of partial feedback in online nonparametric learning},
  author={Cesa-Bianchi, Nicol{\`o} and Gaillard, Pierre and Gentile, Claudio and Gerchinovitz, S{\'e}bastien},
  journal={arXiv preprint arXiv:1702.08211},
  year={2017}
}
@article{khuller1999budgeted,
  title={The budgeted maximum coverage problem},
  author={Khuller, Samir and Moss, Anna and Naor, Joseph Seffi},
  journal={Information processing letters},
  volume={70},
  number={1},
  pages={39--45},
  year={1999},
  publisher={Elsevier}
}
@inproceedings{alon2012optimizing,
  title={Optimizing budget allocation among channels and influencers},
  author={Alon, Noga and Gamzu, Iftah and Tennenholtz, Moshe},
  booktitle={Proceedings of the 21st international conference on World Wide Web},
  pages={381--388},
  year={2012},
  organization={ACM}
}

@article{marsden1990network,
  title={Network data and measurement},
  author={Marsden, Peter V},
  journal={Annual review of sociology},
  volume={16},
  number={1},
  pages={435--463},
  year={1990},
  publisher={Annual Reviews 4139 El Camino Way, PO Box 10139, Palo Alto, CA 94303-0139, USA}
}

@book{dickison2016multilayer,
  title={Multilayer social networks},
  author={Dickison, Mark E and Magnani, Matteo and Rossi, Luca},
  year={2016},
  publisher={Cambridge University Press}
}

@inproceedings{wilder2018maximizing,
  title={Maximizing influence in an unknown social network},
  author={Wilder, Bryan and Immorlica, Nicole and Rice, Eric and Tambe, Milind},
  booktitle={Thirty-Second AAAI Conference on Artificial Intelligence},
  year={2018}
}

@article{robbins1952some,
  title={Some aspects of the sequential design of experiments},
  author={Robbins, Herbert},
  journal={Bulletin of the American Mathematical Society},
  volume={58},
  number={5},
  pages={527--535},
  year={1952},
  publisher={Citeseer}
}
@article{auer2002finite,
  title={Finite-time analysis of the multiarmed bandit problem},
  author={Auer, Peter and Cesa-Bianchi, Nicolo and Fischer, Paul},
  journal={Machine learning},
  volume={47},
  number={2-3},
  pages={235--256},
  year={2002},
  publisher={Springer}
}
@article{bubeck2012regret,
  title={Regret analysis of stochastic and nonstochastic multi-armed bandit problems},
  author={Bubeck, S{\'e}bastien and Cesa-Bianchi, Nicolo and others},
  journal={Foundations and Trends{\textregistered} in Machine Learning},
  volume={5},
  number={1},
  pages={1--122},
  year={2012},
  publisher={Now Publishers, Inc.}
}
@book{serfozo2009basics,
  title={Basics of applied stochastic processes},
  author={Serfozo, Richard},
  year={2009},
  publisher={Springer Science \& Business Media}
}
@article{raginsky2013concentration,
  title={Concentration of measure inequalities in information theory, communications, and coding},
  author={Raginsky, Maxim and Sason, Igal and others},
  journal={Foundations and Trends{\textregistered} in Communications and Information Theory},
  volume={10},
  number={1-2},
  pages={1--246},
  year={2013},
  publisher={Now Publishers, Inc.}
}
@book{barrat2008dynamical,
  title={Dynamical processes on complex networks},
  author={Barrat, Alain and Barthelemy, Marc and Vespignani, Alessandro},
  year={2008},
  publisher={Cambridge university press}
}
@article{masuda2017random,
  title={Random walks and diffusion on networks},
  author={Masuda, Naoki and Porter, Mason A and Lambiotte, Renaud},
  journal={Physics reports},
  volume={716},
  pages={1--58},
  year={2017},
  publisher={Elsevier}
}
@article{gleich2015pagerank,
  title={PageRank beyond the Web},
  author={Gleich, David F},
  journal={SIAM Review},
  volume={57},
  number={3},
  pages={321--363},
  year={2015},
  publisher={SIAM}
}
@article{lovasz1993random,
  title={Random walks on graphs: A survey},
  author={Lov{\'a}sz, L{\'a}szl{\'o} and others},
  journal={Combinatorics, Paul erdos is eighty},
  volume={2},
  number={1},
  pages={1--46},
  year={1993}
}
@article{rosvall2008maps,
  title={Maps of random walks on complex networks reveal community structure},
  author={Rosvall, Martin and Bergstrom, Carl T},
  journal={Proceedings of the National Academy of Sciences},
  volume={105},
  number={4},
  pages={1118--1123},
  year={2008},
  publisher={National Acad Sciences}
}
@inproceedings{kurant2011walking,
  title={Walking on a graph with a magnifying glass: stratified sampling via weighted random walks},
  author={Kurant, Maciej and Gjoka, Minas and Butts, Carter T and Markopoulou, Athina},
  booktitle={Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems},
  pages={281--292},
  year={2011},
  organization={ACM}
}
@article{chen2016general,
  title={A general framework for estimating graphlet statistics via random walk},
  author={Chen, Xiaowei and Li, Yongkun and Wang, Pinghui and Lui, John},
  journal={Proceedings of the VLDB Endowment},
  volume={10},
  number={3},
  pages={253--264},
  year={2016},
  publisher={VLDB Endowment}
}
@inproceedings{pons2005computing,
  title={Computing communities in large networks using random walks},
  author={Pons, Pascal and Latapy, Matthieu},
  booktitle={International symposium on computer and information sciences},
  pages={284--293},
  year={2005},
  organization={Springer}
}
@inproceedings{mavroforakis2015absorbing,
  title={Absorbing random-walk centrality: Theory and algorithms},
  author={Mavroforakis, Charalampos and Mathioudakis, Michael and Gionis, Aristides},
  booktitle={2015 IEEE International Conference on Data Mining},
  pages={901--906},
  year={2015},
  organization={IEEE}
}
@inproceedings{li2019walking,
  title={Walking with Perception: Efficient Random Walk Sampling via Common Neighbor Awareness},
  author={Li, Yongkun and Wu, Zhiyong and Lin, Shuai and Xie, Hong and Lv, Min and Xu, Yinlong and Lui, John CS},
  booktitle={2019 IEEE 35th International Conference on Data Engineering (ICDE)},
  pages={962--973},
  year={2019},
  organization={IEEE}
}
@article{sinatra2011maximal,
  title={Maximal-entropy random walks in complex networks with limited information},
  author={Sinatra, Roberta and G{\'o}mez-Gardenes, Jes{\'u}s and Lambiotte, Renaud and Nicosia, Vincenzo and Latora, Vito},
  journal={Physical Review E},
  volume={83},
  number={3},
  pages={030103},
  year={2011},
  publisher={APS}
}
@article{iwata2001combinatorial,
  title={A combinatorial strongly polynomial algorithm for minimizing submodular functions},
  author={Iwata, Satoru and Fleischer, Lisa and Fujishige, Satoru},
  journal={Journal of the ACM (JACM)},
  volume={48},
  number={4},
  pages={761--777},
  year={2001},
  publisher={ACM}
}
@inproceedings{kapralov2013online,
  title={Online submodular welfare maximization: Greedy is optimal},
  author={Kapralov, Michael and Post, Ian and Vondr{\'a}k, Jan},
  booktitle={Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms},
  pages={1216--1225},
  year={2013},
  organization={SIAM}
}
@inproceedings{soma2015generalization,
  title={A generalization of submodular cover via the diminishing return property on the integer lattice},
  author={Soma, Tasuku and Yoshida, Yuichi},
  booktitle={Advances in Neural Information Processing Systems},
  pages={847--855},
  year={2015}
}


@Article{BCB12,
	author  = {S{\'{e}}bastien Bubeck and Nicol{\`{o}} Cesa{-}Bianchi},
	title   = {Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems},
	journal = {Foundations and Trends® in Machine Learning},
	year    = {2012},
	volume  = {5},
	number  = {1},
	pages   = {1-122},
}
@inproceedings{wang2018thompson,
  title={Thompson Sampling for Combinatorial Semi-Bandits},
  author={Wang, Siwei and Chen, Wei},
  booktitle={International Conference on Machine Learning},
  pages={5114--5122},
  year={2018}
}
@article{gkantsidis2006random,
  title={Random walks in peer-to-peer networks: algorithms and evaluation},
  author={Gkantsidis, Christos and Mihail, Milena and Saberi, Amin},
  journal={Performance Evaluation},
  volume={63},
  number={3},
  pages={241--263},
  year={2006},
  publisher={Elsevier}
}

@inproceedings{lv2002search,
  title={Search and replication in unstructured peer-to-peer networks},
  author={Lv, Qin and Cao, Pei and Cohen, Edith and Li, Kai and Shenker, Scott},
  booktitle={Proceedings of the 16th international conference on Supercomputing},
  pages={84--95},
  year={2002}
}
@article{lerman2006social,
  title={Social browsing on flickr},
  author={Lerman, Kristina and Jones, Laurie},
  journal={arXiv preprint cs/0612047},
  year={2006}
}

@inproceedings{chen2013combinatorial,
  title={Combinatorial multi-armed bandit: General framework and applications},
  author={Chen, Wei and Wang, Yajun and Yuan, Yang},
  booktitle={International Conference on Machine Learning},
  pages={151--159},
  year={2013},
  organization={PMLR}
}

@inproceedings{kempe2003maximizing,
  title={Maximizing the spread of influence through a social network},
  author={Kempe, David and Kleinberg, Jon and Tardos, {\'E}va},
  booktitle={Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining},
  pages={137--146},
  year={2003}
}

@inproceedings{chen2009efficient,
  title={Efficient influence maximization in social networks},
  author={Chen, Wei and Wang, Yajun and Yang, Siyu},
  booktitle={Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining},
  pages={199--208},
  year={2009}
}

@article{wang2012scalable,
  title={Scalable influence maximization for independent cascade model in large-scale social networks},
  author={Wang, Chi and Chen, Wei and Wang, Yajun},
  journal={Data Mining and Knowledge Discovery},
  volume={25},
  number={3},
  pages={545--576},
  year={2012},
  publisher={Springer}
}
@inproceedings{wang2017improving,
  title={Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications},
  author={Wang, Qinshi and Chen, Wei},
  booktitle={Advances in Neural Information Processing Systems},
  pages={1161--1171},
  year={2017}
}

@article{iyer2012algorithms,
  title={Algorithms for approximate minimization of the difference between submodular functions, with applications},
  author={Iyer, Rishabh and Bilmes, Jeff},
  journal={arXiv preprint arXiv:1207.0560},
  year={2012}
}
@inproceedings{singh2012bisubmodular,
  title={On bisubmodular maximization},
  author={Singh, Ajit and Guillory, Andrew and Bilmes, Jeff},
  booktitle={Artificial Intelligence and Statistics},
  pages={1055--1063},
  year={2012}
}
@article{narasimhan2012submodular,
  title={A submodular-supermodular procedure with applications to discriminative structure learning},
  author={Narasimhan, Mukund and Bilmes, Jeff A},
  journal={arXiv preprint arXiv:1207.1404},
  year={2012}
}
@inproceedings{merlis2019batch,
  title={Batch-size independent regret bounds for the combinatorial multi-armed bandit problem},
  author={Merlis, Nadav and Mannor, Shie},
  booktitle={Conference on Learning Theory},
  pages={2465--2489},
  year={2019},
  organization={PMLR}
}

@inproceedings{kveton2015tight,
  title={Tight regret bounds for stochastic combinatorial semi-bandits},
  author={Kveton, Branislav and Wen, Zheng and Ashkan, Azin and Szepesvari, Csaba},
  booktitle={Artificial Intelligence and Statistics},
  pages={535--543},
  year={2015},
  organization={PMLR}
}

@inproceedings{degenne2016combinatorial,
  title={Combinatorial semi-bandit with known covariance},
  author={Degenne, R{\'e}my and Perchet, Vianney},
  booktitle={Proceedings of the 30th International Conference on Neural Information Processing Systems},
  pages={2972--2980},
  year={2016}
}

@article{kveton2015combinatorial,
  title={Combinatorial cascading bandits},
  author={Kveton, Branislav and Wen, Zheng and Ashkan, Azin and Szepesvari, Csaba},
  journal={arXiv preprint arXiv:1507.04208},
  year={2015}
}

@article{liu2021multi,
  title={Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning},
  author={Liu, Xutong and Zuo, Jinhang and Chen, Xiaowei and Chen, Wei and Lui, John},
  journal={arXiv preprint arXiv:2106.05065},
  year={2021}
}
@article{li2019improved,
  title={Improved algorithm on online clustering of bandits},
  author={Li, Shuai and Chen, Wei and Leung, Kwong-Sak},
  journal={arXiv preprint arXiv:1902.09162},
  year={2019}
}
@inproceedings{li2018online,
  title={Online clustering of contextual cascading bandits},
  author={Li, Shuai and Zhang, Shengyu},
  booktitle={Thirty-Second AAAI Conference on Artificial Intelligence},
  year={2018}
}
@inproceedings{gentile2014online,
  title={Online clustering of bandits},
  author={Gentile, Claudio and Li, Shuai and Zappella, Giovanni},
  booktitle={International Conference on Machine Learning},
  pages={757--765},
  year={2014},
  organization={PMLR}
}
@article{abbasi2011improved,
  title={Improved algorithms for linear stochastic bandits},
  author={Abbasi-Yadkori, Yasin and P{\'a}l, D{\'a}vid and Szepesv{\'a}ri, Csaba},
  journal={Advances in neural information processing systems},
  volume={24},
  pages={2312--2320},
  year={2011}
}
@article{zheng2020locally,
  title={Locally differentially private (contextual) bandits learning},
  author={Zheng, Kai and Cai, Tianle and Huang, Weiran and Li, Zhenguo and Wang, Liwei},
  journal={arXiv preprint arXiv:2006.00701},
  year={2020}
}
@article{shariff2018differentially,
  title={Differentially private contextual linear bandits},
  author={Shariff, Roshan and Sheffet, Or},
  journal={arXiv preprint arXiv:1810.00068},
  year={2018}
}
@inproceedings{dwork2006calibrating,
  title={Calibrating noise to sensitivity in private data analysis},
  author={Dwork, Cynthia and McSherry, Frank and Nissim, Kobbi and Smith, Adam},
  booktitle={Theory of cryptography conference},
  pages={265--284},
  year={2006},
  organization={Springer}
}
@article{chan2011private,
  title={Private and continual release of statistics},
  author={Chan, T-H Hubert and Shi, Elaine and Song, Dawn},
  journal={ACM Transactions on Information and System Security (TISSEC)},
  volume={14},
  number={3},
  pages={1--24},
  year={2011},
  publisher={ACM New York, NY, USA}
}
@article{dubey2020differentially,
  title={Differentially-private federated linear bandits},
  author={Dubey, Abhimanyu and Pentland, Alex},
  journal={arXiv preprint arXiv:2010.11425},
  year={2020}
}
@inproceedings{gentile2017context,
  title={On context-dependent clustering of bandits},
  author={Gentile, Claudio and Li, Shuai and Kar, Purushottam and Karatzoglou, Alexandros and Zappella, Giovanni and Etrue, Evans},
  booktitle={International Conference on Machine Learning},
  pages={1253--1262},
  year={2017},
  organization={PMLR}
}
@inproceedings{korda2016distributed,
  title={Distributed clustering of linear bandits in peer to peer networks},
  author={Korda, Nathan and Szorenyi, Balazs and Li, Shuai},
  booktitle={International conference on machine learning},
  pages={1301--1309},
  year={2016},
  organization={PMLR}
}
@article{li2021asynchronous,
  title={Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits},
  author={Li, Chuanhao and Wang, Hongning},
  journal={arXiv preprint arXiv:2110.01463},
  year={2021}
}
@inproceedings{wang2017improving,
  title={Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications},
  author={Wang, Qinshi and Chen, Wei},
  booktitle={Advances in Neural Information Processing Systems},
  pages={1161--1171},
  year={2017}
}

@article{iyer2012algorithms,
  title={Algorithms for approximate minimization of the difference between submodular functions, with applications},
  author={Iyer, Rishabh and Bilmes, Jeff},
  journal={arXiv preprint arXiv:1207.0560},
  year={2012}
}
@inproceedings{singh2012bisubmodular,
  title={On bisubmodular maximization},
  author={Singh, Ajit and Guillory, Andrew and Bilmes, Jeff},
  booktitle={Artificial Intelligence and Statistics},
  pages={1055--1063},
  year={2012}
}
@article{narasimhan2012submodular,
  title={A submodular-supermodular procedure with applications to discriminative structure learning},
  author={Narasimhan, Mukund and Bilmes, Jeff A},
  journal={arXiv preprint arXiv:1207.1404},
  year={2012}
}
@inproceedings{merlis2019batch,
  title={Batch-size independent regret bounds for the combinatorial multi-armed bandit problem},
  author={Merlis, Nadav and Mannor, Shie},
  booktitle={Conference on Learning Theory},
  pages={2465--2489},
  year={2019},
  organization={PMLR}
}

@inproceedings{kveton2015tight,
  title={Tight regret bounds for stochastic combinatorial semi-bandits},
  author={Kveton, Branislav and Wen, Zheng and Ashkan, Azin and Szepesvari, Csaba},
  booktitle={Artificial Intelligence and Statistics},
  pages={535--543},
  year={2015},
  organization={PMLR}
}

@inproceedings{degenne2016combinatorial,
  title={Combinatorial semi-bandit with known covariance},
  author={Degenne, R{\'e}my and Perchet, Vianney},
  booktitle={Proceedings of the 30th International Conference on Neural Information Processing Systems},
  pages={2972--2980},
  year={2016}
}

@article{kveton2015combinatorial,
  title={Combinatorial cascading bandits},
  author={Kveton, Branislav and Wen, Zheng and Ashkan, Azin and Szepesvari, Csaba},
  journal={arXiv preprint arXiv:1507.04208},
  year={2015}
}

@article{liu2021multi,
  title={Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning},
  author={Liu, Xutong and Zuo, Jinhang and Chen, Xiaowei and Chen, Wei and Lui, John},
  journal={arXiv preprint arXiv:2106.05065},
  year={2021}
}

@inproceedings{li2016collaborative,
  title={Collaborative filtering bandits},
  author={Li, Shuai and Karatzoglou, Alexandros and Gentile, Claudio},
  booktitle={Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval},
  pages={539--548},
  year={2016}
}

@article{anandkumar2011distributed,
  title={Distributed algorithms for learning and cognitive medium access with logarithmic regret},
  author={Anandkumar, Animashree and Michael, Nithin and Tang, Ao Kevin and Swami, Ananthram},
  journal={IEEE Journal on Selected Areas in Communications},
  volume={29},
  number={4},
  pages={731--745},
  year={2011},
  publisher={IEEE}
}

@inproceedings{rosenski2016multi,
  title={Multi-player bandits--a musical chairs approach},
  author={Rosenski, Jonathan and Shamir, Ohad and Szlak, Liran},
  booktitle={International Conference on Machine Learning},
  pages={155--163},
  year={2016},
  organization={PMLR}
}

@article{boursier2019sic,
  title={SIC-MMAB: synchronisation involves communication in multiplayer multi-armed bandits},
  author={Boursier, Etienne and Perchet, Vianney},
  journal={Advances in Neural Information Processing Systems},
  volume={32},
  year={2019}
}

@article{bistritz2018distributed,
  title={Distributed multi-player bandits-a game of thrones approach},
  author={Bistritz, Ilai and Leshem, Amir},
  journal={Advances in Neural Information Processing Systems},
  volume={31},
  year={2018}
}

@inproceedings{chu2011contextual,
  title={Contextual bandits with linear payoff functions},
  author={Chu, Wei and Li, Lihong and Reyzin, Lev and Schapire, Robert},
  booktitle={Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
  pages={208--214},
  year={2011},
  organization={JMLR Workshop and Conference Proceedings}
}

@inproceedings{li2010contextual,
  title={A contextual-bandit approach to personalized news article recommendation},
  author={Li, Lihong and Chu, Wei and Langford, John and Schapire, Robert E},
  booktitle={Proceedings of the 19th international conference on World wide web},
  pages={661--670},
  year={2010}
}

@book{lattimore2020bandit,
  title={Bandit Algorithms},
  author={Lattimore, Tor and Szepesv{\'a}ri, Csaba},
  year={2020},
  publisher={Cambridge University Press}
}

@article{kairouz2021advances,
  title={Advances and open problems in federated learning},
  author={Kairouz, Peter and McMahan, H Brendan and Avent, Brendan and Bellet, Aur{\'e}lien and Bennis, Mehdi and Bhagoji, Arjun Nitin and Bonawitz, Kallista and Charles, Zachary and Cormode, Graham and Cummings, Rachel and others},
  journal={Foundations and Trends{\textregistered} in Machine Learning},
  volume={14},
  number={1--2},
  pages={1--210},
  year={2021},
  publisher={Now Publishers, Inc.}
}

@inproceedings{shi2021federated,
  title={Federated multi-armed bandits},
  author={Shi, Chengshuai and Shen, Cong},
  booktitle={Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI)},
  year={2021}
}

@inproceedings{zhu2021federated,
  title={Federated bandit: A gossiping approach},
  author={Zhu, Zhaowei and Zhu, Jingxuan and Liu, Ji and Liu, Yang},
  booktitle={Abstract Proceedings of the 2021 ACM SIGMETRICS/International Conference on Measurement and Modeling of Computer Systems},
  pages={3--4},
  year={2021}
}

@inproceedings{zhang2020conversational,
  title={Conversational contextual bandit: Algorithm and application},
  author={Zhang, Xiaoying and Xie, Hong and Li, Hang and CS Lui, John},
  booktitle={Proceedings of The Web Conference 2020},
  pages={662--672},
  year={2020}
}

@inproceedings{li2021unifying,
  title={Unifying offline causal inference and online bandit learning for data driven decision},
  author={Li, Ye and Xie, Hong and Lin, Yishi and Lui, John CS},
  booktitle={Proceedings of the Web Conference 2021},
  pages={2291--2303},
  year={2021}
}

@article{tao2011topics,
  title={Topics in random matrix theory},
  author={Tao, Terence},
  journal={Graduate Studies in Mathematics},
  volume={132},
  year={2011},
  publisher={Citeseer}
}

@article{dani2008stochastic,
  title={Stochastic linear optimization under bandit feedback},
  author={Dani, Varsha and Hayes, Thomas P and Kakade, Sham M},
  year={2008}
}