{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:46Z","timestamp":1772164126729,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["SRFS2122-4S02 and CUHK PDFS2324-4S04"],"award-info":[{"award-number":["SRFS2122-4S02 and CUHK PDFS2324-4S04"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-2325956, CAREER 2045641, CPS-2136199, CNS-2102963, and CNS-2106299"],"award-info":[{"award-number":["CNS-2325956, CAREER 2045641, CPS-2136199, CNS-2102963, and CNS-2106299"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"JiangsuNSF","award":["BK20230784"],"award-info":[{"award-number":["BK20230784"]}]},{"name":"Inovation Program of State Key Laboratory for Novel Software Technology at Nanjing University","award":["ZZKT2024B15"],"award-info":[{"award-number":["ZZKT2024B15"]}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSFC","award":["62306138"],"award-info":[{"award-number":["62306138"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,9]]},"DOI":"10.1145\/3726854.3727272","type":"proceedings-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T09:46:42Z","timestamp":1749030402000},"page":"109-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Asynchronous Multi-Agent Bandits: Fully Distributed\n                    <i>vs.<\/i>\n                    Leader-Coordinated Algorithms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8043-8521","authenticated-orcid":false,"given":"Xuchuang","family":"Wang","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1420-9214","authenticated-orcid":false,"given":"Yu-Zhen Janice","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8628-5873","authenticated-orcid":false,"given":"Xutong","family":"Liu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9056-0500","authenticated-orcid":false,"given":"Lin","family":"Yang","sequence":"additional","affiliation":[{"name":"Nanjing Universary, Suzhou, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-2254","authenticated-orcid":false,"given":"Mohammad","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7808-7375","authenticated-orcid":false,"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7466-0384","authenticated-orcid":false,"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Boursier Etienne","year":"2019","unstructured":"Etienne Boursier and Vianney Perchet. 2019. SIC-MMAB: synchronisation involves communication in multiplayer multi-armed bandits. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_2_1","volume-title":"On-Demand Communication for Asynchronous Multi-Agent Bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 3903--3930","author":"Janice Chen Yu-Zhen","year":"2023","unstructured":"Yu-Zhen Janice Chen, Lin Yang, Xuchuang Wang, Xutong Liu, Mohammad Hajiesmaili, John C.S. Lui, and Don Towsley. 2023. On-Demand Communication for Asynchronous Multi-Agent Bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 3903--3930."},{"key":"e_1_3_2_1_3_1","volume-title":"Avito Context Ad Clicks. https:\/\/www.kaggle.com\/c\/avito-context-ad-clicks Retrieved","year":"2022","unstructured":"Kaggle. 2015. Avito Context Ad Clicks. https:\/\/www.kaggle.com\/c\/avito-context-ad-clicks Retrieved Jul. 22, 2022 from"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Tze Leung Lai Herbert Robbins et al. 1985. Asymptotically efficient adaptive allocation rules. Advances in applied mathematics Vol. 6 1 (1985) 4--22.","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"e_1_3_2_1_5_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 4120--4129","author":"Wang Po-An","year":"2020","unstructured":"Po-An Wang, Alexandre Proutiere, Kaito Ariu, Yassir Jedra, and Alessio Russo. 2020. Optimal algorithms for multiplayer multi-armed bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 4120--4129."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3727129"},{"key":"e_1_3_2_1_7_1","volume-title":"Distributed Bandits with Heterogeneous Agents. In In Proceedings of The IEEE International Conference on Computer Communications","author":"Yang Lin","year":"2022","unstructured":"Lin Yang, Yu-Zhen Janice Chen, Mohammad Hajiesmaili, John C.S. Lui, and Don Towsley. 2022. Distributed Bandits with Heterogeneous Agents. In In Proceedings of The IEEE International Conference on Computer Communications 2022."},{"key":"e_1_3_2_1_8_1","volume-title":"Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs. arXiv preprint arXiv:2308.04314","author":"Yang Lin","year":"2023","unstructured":"Lin Yang, Xuchuang Wang, Lijun Zhang, Mohammad Hajiesmaili, John C.S. Lui, and Don Towsley. 2023. Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs. arXiv preprint arXiv:2308.04314 (2023)."},{"key":"e_1_3_2_1_9_1","volume-title":"Journal of Machine Learning Research","volume":"22","author":"Zimmert Julian","year":"2021","unstructured":"Julian Zimmert and Yevgeny Seldin. 2021. Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits. Journal of Machine Learning Research, Vol. 22, 28 (2021), 1--49."}],"event":{"name":"SIGMETRICS '25: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"Stony Brook NY USA","acronym":"SIGMETRICS '25","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstracts of the 2025 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726854.3727272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726854.3727272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T22:23:04Z","timestamp":1752704584000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726854.3727272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":9,"alternative-id":["10.1145\/3726854.3727272","10.1145\/3726854"],"URL":"https:\/\/doi.org\/10.1145\/3726854.3727272","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3744970.3727272","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"2025-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}