@inproceedings{slivkins2011contextual,
  title        = {Contextual bandits with similarity information},
  author       = {Slivkins, Aleksandrs},
  booktitle    = {Proceedings of the 24th annual Conference On Learning Theory},
  pages        = {679--702},
  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}
}

@article{shi2021almost,
  title   = {(Almost) Free Incentivized Exploration from Decentralized Learning Agents},
  author  = {Shi, Chengshuai and Xu, Haifeng and Xiong, Wei and Shen, Cong},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  pages   = {560--571},
  year    = {2021}
}

@inproceedings{chen2018incentivizing,
  title        = {Incentivizing exploration by heterogeneous users},
  author       = {Chen, Bangrui and Frazier, Peter and Kempe, David},
  booktitle    = {Conference On Learning Theory},
  pages        = {798--818},
  year         = {2018},
  organization = {PMLR}
}

@article{kolla2018collaborative,
  title     = {Collaborative learning of stochastic bandits over a social network},
  author    = {Kolla, Ravi Kumar and Jagannathan, Krishna and Gopalan, Aditya},
  journal   = {IEEE/ACM Transactions on Networking},
  volume    = {26},
  number    = {4},
  pages     = {1782--1795},
  year      = {2018},
  publisher = {IEEE}
}

@article{madhushani2021one,
  title   = {One more step towards reality: Cooperative bandits with imperfect communication},
  author  = {Madhushani, Udari and Dubey, Abhimanyu and Leonard, Naomi and Pentland, Alex},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  pages   = {7813--7824},
  year    = {2021}
}

@article{bistritz2020cooperative,
  title   = {Cooperative multi-player bandit optimization},
  author  = {Bistritz, Ilai and Bambos, Nicholas},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {33},
  pages   = {2016--2027},
  year    = {2020}
}

@inproceedings{cesa2016delay,
  title        = {Delay and cooperation in nonstochastic bandits},
  author       = {Cesa-Bianchi, Nicol‘o and Gentile, Claudio and Mansour, Yishay and Minora, Alberto},
  booktitle    = {Conference on Learning Theory},
  pages        = {605--622},
  year         = {2016},
  organization = {PMLR}
}

@inproceedings{buccapatnam2015information,
  title        = {Information sharing in distributed stochastic bandits},
  author       = {Buccapatnam, Swapna and Tan, Jian and Zhang, Li},
  booktitle    = {2015 IEEE Conference on Computer Communications (INFOCOM)},
  pages        = {2605--2613},
  year         = {2015},
  organization = {IEEE}
}

@inproceedings{szorenyi2013gossip,
  title        = {Gossip-based distributed stochastic bandit algorithms},
  author       = {Szorenyi, Balazs and Busa-Fekete, R{\'o}bert and Hegedus, Istv{\'a}n and Orm{\'a}ndi, R{\'o}bert and Jelasity, M{\'a}rk and K{\'e}gl, Bal{\'a}zs},
  booktitle    = {International Conference on Machine Learning},
  pages        = {19--27},
  year         = {2013},
  organization = {PMLR}
}

@inproceedings{feraud2019decentralized,
  title        = {Decentralized exploration in multi-armed bandits},
  author       = {F{\'e}raud, Rapha{\"e}l and Alami, R{\'e}da and Laroche, Romain},
  booktitle    = {International Conference on Machine Learning},
  pages        = {1901--1909},
  year         = {2019},
  organization = {PMLR}
}

@inproceedings{wang2019distributed,
  title     = {Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication},
  author    = {Wang, Yuanhao and Hu, Jiachen and Chen, Xiaoyu and Wang, Liwei},
  booktitle = {International Conference on Learning Representations},
  year      = {2019}
}

@article{bar2019individual,
  title   = {Individual regret in cooperative nonstochastic multi-armed bandits},
  author  = {Bar-On, Yogev and Mansour, Yishay},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {32},
  year    = {2019}
}

@inproceedings{He2013online,
  title     = {Endhost-based shortest path routing in dynamic networks.},
  author    = {He, Ting and Goeckel, Dennis and Raghavendra, Ramya and Towsley, Don},
  booktitle = {Proc. IEEE INFOCOM},
  pages     = {2202-2210},
  year      = {2013}
}

@inproceedings{chakraborty2017coordinated,
  title     = {Coordinated Versus Decentralized Exploration In Multi-Agent Multi-Armed Bandits.},
  author    = {Chakraborty, Mithun and Chua, Kai Yee Phoebe and Das, Sanmay and Juba, Brendan},
  booktitle = {IJCAI},
  pages     = {164--170},
  year      = {2017}
}

@inproceedings{dubey2020cooperative,
  title        = {Cooperative multi-agent bandits with heavy tails},
  author       = {Dubey, Abhimanyu and others},
  booktitle    = {International Conference on Machine Learning},
  pages        = {2730--2739},
  year         = {2020},
  organization = {PMLR}
}

@article{sankararaman2019social,
  title     = {Social learning in multi agent multi armed bandits},
  author    = {Sankararaman, Abishek and Ganesh, Ayalvadi and Shakkottai, Sanjay},
  journal   = {Proceedings of the ACM on Measurement and Analysis of Computing Systems},
  volume    = {3},
  number    = {3},
  pages     = {1--35},
  year      = {2019},
  publisher = {ACM New York, NY, USA}
}

@article{hossain2021fair,
  title   = {Fair algorithms for multi-agent multi-armed bandits},
  author  = {Hossain, Safwan and Micha, Evi and Shah, Nisarg},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  pages   = {24005--24017},
  year    = {2021}
}

@inproceedings{dagan2018better,
  title        = {A better resource allocation algorithm with semi-bandit feedback},
  author       = {Dagan, Yuval and Koby, Crammer},
  booktitle    = {Algorithmic Learning Theory},
  pages        = {268--320},
  year         = {2018},
  organization = {PMLR}
}

@inproceedings{lattimore2014optimal,
  title     = {Optimal resource allocation with semi-bandit feedback},
  author    = {Lattimore, Tor and Crammer, Koby and Szepesv{\'a}ri, Csaba},
  booktitle = {Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence},
  pages     = {477--486},
  year      = {2014}
}

@inproceedings{johari2017matching,
  title     = {Matching while Learning},
  author    = {Johari, Ramesh and Kamble, Vijay and Kanoria, Yash},
  booktitle = {Proceedings of the 2017 ACM Conference on Economics and Computation},
  pages     = {119--119},
  year      = {2017}
}

@article{talebi2018learning,
  title     = {Learning proportionally fair allocations with low regret},
  author    = {Talebi, Mohammad Sadegh and Proutiere, Alexandre},
  journal   = {Proceedings of the ACM on Measurement and Analysis of Computing Systems},
  volume    = {2},
  number    = {2},
  pages     = {1--31},
  year      = {2018},
  publisher = {ACM New York, NY, USA}
}

@inproceedings{chawla2020gossiping,
  title        = {The gossiping insert-eliminate algorithm for multi-agent bandits},
  author       = {Chawla, Ronshee and Sankararaman, Abishek and Ganesh, Ayalvadi and Shakkottai, Sanjay},
  booktitle    = {International Conference on Artificial Intelligence and Statistics},
  pages        = {3471--3481},
  year         = {2020},
  organization = {PMLR}
}

@article{yang2021cooperative,
  title   = {Cooperative stochastic bandits with asynchronous agents and constrained feedback},
  author  = {Yang, Lin and Chen, Yu-Zhen Janice and Pasteris, Stephen and Hajiesmaili, Mohammad and Lui, John and Towsley, Don},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  pages   = {8885--8897},
  year    = {2021}
}

@inproceedings{yang2022distributed,
  title     = {Distributed Bandits with Heterogeneous Agents},
  author    = {Yang, Lin and Chen, Yu-Zhen Janice and Hajiesmaili, Mohammad and Lui, John C.S. and Towsley, Don},
  booktitle = {In Proceedings of The IEEE International Conference on Computer Communications 2022},
  year      = {2022}
}

@article{madhushani2021call,
  title   = {When to call your neighbor? strategic communication in cooperative stochastic bandits},
  author  = {Madhushani, Udari and Leonard, Naomi},
  journal = {arXiv preprint arXiv:2110.04396},
  year    = {2021}
}

@inproceedings{combes2015learning,
  title     = {Learning to rank: Regret lower bounds and efficient algorithms},
  author    = {Combes, Richard and Magureanu, Stefan and Proutiere, Alexandre and Laroche, Cyrille},
  booktitle = {Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems},
  pages     = {231--244},
  year      = {2015}
}

@inproceedings{wang2020optimal,
  title        = {Optimal algorithms for multiplayer multi-armed bandits},
  author       = {Wang, Po-An and Proutiere, Alexandre and Ariu, Kaito and Jedra, Yassir and Russo, Alessio},
  booktitle    = {International Conference on Artificial Intelligence and Statistics},
  pages        = {4120--4129},
  year         = {2020},
  organization = {PMLR}
}

@inproceedings{combes2014unimodal,
  title        = {Unimodal bandits: Regret lower bounds and optimal algorithms},
  author       = {Combes, Richard and Proutiere, Alexandre},
  booktitle    = {International Conference on Machine Learning},
  pages        = {521--529},
  year         = {2014},
  organization = {PMLR}
}

@article{cappe2013kullback,
  title     = {Kullback-Leibler upper confidence bounds for optimal sequential allocation},
  author    = {Capp{\'e}, Olivier and Garivier, Aur{\'e}lien and Maillard, Odalric-Ambrym and Munos, R{\'e}mi and Stoltz, Gilles},
  journal   = {The Annals of Statistics},
  pages     = {1516--1541},
  year      = {2013},
  publisher = {JSTOR}
}

@article{lai1985asymptotically,
  title   = {Asymptotically efficient adaptive allocation rules},
  author  = {Lai, Tze Leung and Robbins, Herbert and others},
  journal = {Advances in applied mathematics},
  volume  = {6},
  number  = {1},
  pages   = {4--22},
  year    = {1985}
}

@article{auer2002using,
  title   = {Using confidence bounds for exploitation-exploration trade-offs},
  author  = {Auer, Peter},
  journal = {Journal of Machine Learning Research},
  volume  = {3},
  number  = {Nov},
  pages   = {397--422},
  year    = {2002}
}

@article{even2006action,
  title   = {Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems.},
  author  = {Even-Dar, Eyal and Mannor, Shie and Mansour, Yishay and Mahadevan, Sridhar},
  journal = {Journal of machine learning research},
  volume  = {7},
  number  = {6},
  year    = {2006}
}

@inproceedings{shi2021federatedpersonal,
  title        = {Federated multi-armed bandits with personalization},
  author       = {Shi, Chengshuai and Shen, Cong and Yang, Jing},
  booktitle    = {International Conference on Artificial Intelligence and Statistics},
  pages        = {2917--2925},
  year         = {2021},
  organization = {PMLR}
}

@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}
}

@article{huang2021federated,
  title   = {Federated Linear Contextual Bandits},
  author  = {Huang, Ruiquan and Wu, Weiqiang and Yang, Jing and Shen, Cong},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  year    = {2021}
}

@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}
}

@inproceedings{mehrabian2020practical,
  title        = {A practical algorithm for multiplayer bandits when arm means vary among players},
  author       = {Mehrabian, Abbas and Boursier, Etienne and Kaufmann, Emilie and Perchet, Vianney},
  booktitle    = {International Conference on Artificial Intelligence and Statistics},
  pages        = {1211--1221},
  year         = {2020},
  organization = {PMLR}
}

@inproceedings{wang2020distributed,
  author    = {Yuanhao Wang and
               Jiachen Hu and
               Xiaoyu Chen and
               Liwei Wang},
  title     = {Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication},
  booktitle = {8th International Conference on Learning Representations, {ICLR} 2020,
               Addis Ababa, Ethiopia, April 26-30, 2020},
  year      = {2020}
}

@article{shi2021heterogeneous,
  title   = {Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization},
  author  = {Shi, Chengshuai and Xiong, Wei and Shen, Cong and Yang, Jing},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  year    = {2021}
}

@article{hillel2013distributed,
  title   = {Distributed exploration in multi-armed bandits},
  author  = {Hillel, Eshcar and Karnin, Zohar S and Koren, Tomer and Lempel, Ronny and Somekh, Oren},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {26},
  year    = {2013}
}

@inproceedings{tao2019collaborative,
  title        = {Collaborative learning with limited interaction: Tight bounds for distributed exploration in multi-armed bandits},
  author       = {Tao, Chao and Zhang, Qin and Zhou, Yuan},
  booktitle    = {2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)},
  pages        = {126--146},
  year         = {2019},
  organization = {IEEE}
}

@inproceedings{karpov2020collaborative,
  title        = {Collaborative top distribution identifications with limited interaction},
  author       = {Karpov, Nikolai and Zhang, Qin and Zhou, Yuan},
  booktitle    = {2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
  pages        = {160--171},
  year         = {2020},
  organization = {IEEE}
}


@inproceedings{landgren2016distributed,
  title        = {Distributed cooperative decision-making in multiarmed bandits: Frequentist and bayesian algorithms},
  author       = {Landgren, Peter and Srivastava, Vaibhav and Leonard, Naomi Ehrich},
  booktitle    = {2016 IEEE 55th Conference on Decision and Control (CDC)},
  pages        = {167--172},
  year         = {2016},
  organization = {IEEE}
}

@article{martinez2019decentralized,
  title   = {Decentralized cooperative stochastic bandits},
  author  = {Mart{\'i}nez-Rubio, David and Kanade, Varun and Rebeschini, Patrick},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {32},
  year    = {2019}
}

@inproceedings{zou2014online,
  title        = {Online shortest path routing: The value of information},
  author       = {Zou, Zhenhua and Proutiere, Alexandre and Johansson, Mikael},
  booktitle    = {2014 American Control Conference},
  pages        = {2142--2147},
  year         = {2014},
  organization = {IEEE}
}

@article{talebi2017stochastic,
  title     = {Stochastic online shortest path routing: The value of feedback},
  author    = {Talebi, Mohammad Sadegh and Zou, Zhenhua and Combes, Richard and Proutiere, Alexandre and Johansson, Mikael},
  journal   = {IEEE Transactions on Automatic Control},
  volume    = {63},
  number    = {4},
  pages     = {915--930},
  year      = {2017},
  publisher = {IEEE}
}

@inproceedings{tang2014ensemble,
  title     = {Ensemble contextual bandits for personalized recommendation},
  author    = {Tang, Liang and Jiang, Yexi and Li, Lei and Li, Tao},
  booktitle = {Proceedings of the 8th ACM Conference on Recommender Systems},
  pages     = {73--80},
  year      = {2014}
}

@inproceedings{mahadik2020fast,
  title     = {Fast distributed bandits for online recommendation systems},
  author    = {Mahadik, Kanak and Wu, Qingyun and Li, Shuai and Sabne, Amit},
  booktitle = {Proceedings of the 34th ACM international conference on supercomputing},
  pages     = {1--13},
  year      = {2020}
}

@article{bretagnolle1978estimation,
  title   = {Estimation des densit{\'e}s: risque minimax},
  author  = {Bretagnolle, Jean and Huber, Catherine},
  journal = {S{\'e}minaire de probabilit{\'e}s de Strasbourg},
  volume  = {12},
  pages   = {342--363},
  year    = {1978}
}

@misc{adclicks,
  author = {Avito},
  title  = {\emph{Avito Context Ad Clicks}},
  year   = {2015},
  note   = {\url{https://www.kaggle.com/c/avito-context-ad-clicks}}
}

@article{bistritz2021game,
  title     = {Game of thrones: Fully distributed learning for multiplayer bandits},
  author    = {Bistritz, Ilai and Leshem, Amir},
  journal   = {Mathematics of Operations Research},
  volume    = {46},
  number    = {1},
  pages     = {159--178},
  year      = {2021},
  publisher = {INFORMS}
}

@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{lattimore2020bandit,
  title     = {Bandit algorithms},
  author    = {Lattimore, Tor and Szepesv{\'a}ri, Csaba},
  year      = {2020},
  publisher = {Cambridge University Press}
}

@article{anantharam1987asymptotically,
  title     = {Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: IID rewards},
  author    = {Anantharam, Venkatachalam and Varaiya, Pravin and Walrand, Jean},
  journal   = {IEEE Transactions on Automatic Control},
  volume    = {32},
  number    = {11},
  pages     = {968--976},
  year      = {1987},
  publisher = {IEEE}
}

@article{bastani2021mostly,
  title     = {Mostly exploration-free algorithms for contextual bandits},
  author    = {Bastani, Hamsa and Bayati, Mohsen and Khosravi, Khashayar},
  journal   = {Management Science},
  volume    = {67},
  number    = {3},
  pages     = {1329--1349},
  year      = {2021},
  publisher = {INFORMS}
}

@article{baek2021fair,
  title   = {Fair exploration via axiomatic bargaining},
  author  = {Baek, Jackie and Farias, Vivek},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  pages   = {22034--22045},
  year    = {2021}
}

@article{lai1987adaptive,
  title     = {Adaptive treatment allocation and the multi-armed bandit problem},
  author    = {Lai, Tze Leung},
  journal   = {The Annals of Statistics},
  pages     = {1091--1114},
  year      = {1987},
  publisher = {JSTOR}
}

@article{aziz2021multi,
  title   = {On multi-armed bandit designs for dose-finding clinical trials},
  author  = {Aziz, Maryam and Kaufmann, Emilie and Riviere, Marie-Karelle},
  journal = {Journal of Machine Learning Research},
  volume  = {22},
  number  = {1-38},
  pages   = {4},
  year    = {2021}
}

@article{villar2015multi,
  title     = {Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges},
  author    = {Villar, Sof{\'\i}a S and Bowden, Jack and Wason, James},
  journal   = {Statistical science: a review journal of the Institute of Mathematical Statistics},
  volume    = {30},
  number    = {2},
  pages     = {199},
  year      = {2015},
  publisher = {Europe PMC Funders}
}

@article{jiang2023multi,
  title     = {Multi-agent bandit with agent-dependent expected rewards},
  author    = {Jiang, Fan and Cheng, Hui},
  journal   = {Swarm Intelligence},
  pages     = {1--33},
  year      = {2023},
  publisher = {Springer}
}


@inproceedings{kaufmann2012thompson,
  title        = {Thompson sampling: An asymptotically optimal finite-time analysis},
  author       = {Kaufmann, Emilie and Korda, Nathaniel and Munos, R{\'e}mi},
  booktitle    = {Algorithmic Learning Theory: 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings 23},
  pages        = {199--213},
  year         = {2012},
  organization = {Springer}
}

@inproceedings{kamali2015all,
  title        = {All-around near-optimal solutions for the online bin packing problem},
  author       = {Kamali, Shahin and L{\'o}pez-Ortiz, Alejandro},
  booktitle    = {Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings 26},
  pages        = {727--739},
  year         = {2015},
  organization = {Springer}
}

@article{wan2021metadata,
  title   = {Metadata-based multi-task bandits with bayesian hierarchical models},
  author  = {Wan, Runzhe and Ge, Lin and Song, Rui},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {34},
  pages   = {29655--29668},
  year    = {2021}
}

@inproceedings{kveton2021meta,
  title        = {Meta-thompson sampling},
  author       = {Kveton, Branislav and Konobeev, Mikhail and Zaheer, Manzil and Hsu, Chih-wei and Mladenov, Martin and Boutilier, Craig and Szepesvari, Csaba},
  booktitle    = {International Conference on Machine Learning},
  pages        = {5884--5893},
  year         = {2021},
  organization = {PMLR}
}