{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T21:15:09Z","timestamp":1772658909482,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306138"],"award-info":[{"award-number":["62306138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu NSF","award":["BK20230784"],"award-info":[{"award-number":["BK20230784"]}]},{"name":"Suzhou\u2019s \u201cJiebang Guashuai\u201d Project for Key Core Technologies","award":["SYG2024134"],"award-info":[{"award-number":["SYG2024134"]}]},{"DOI":"10.13039\/501100001809","name":"Innovation Program of State Key Laboratory for Novel Software Technology at Nanjing University","doi-asserted-by":"publisher","award":["ZZKT2024B15"],"award-info":[{"award-number":["ZZKT2024B15"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Innovation Program of State Key Laboratory for Novel Software Technology at Nanjing University","doi-asserted-by":"publisher","award":["ZZKT2025B25"],"award-info":[{"award-number":["ZZKT2025B25"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council","award":["GRF-14202925"],"award-info":[{"award-number":["GRF-14202925"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2026.3662342","type":"journal-article","created":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:43:47Z","timestamp":1772138627000},"page":"3609-3624","source":"Crossref","is-referenced-by-count":0,"title":["Cooperative Bandit Algorithms With Optimal Regret and Communication Costs"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9056-0500","authenticated-orcid":false,"given":"Lin","family":"Yang","sequence":"first","affiliation":[{"name":"School of Intelligence Science and Technology, Nanjing University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8043-8521","authenticated-orcid":false,"given":"Xuchuang","family":"Wang","sequence":"additional","affiliation":[{"name":"Manning College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1547-7401","authenticated-orcid":false,"given":"Haoxu","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Intelligence Science and Technology, Nanjing University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-2254","authenticated-orcid":false,"given":"Mohammad H.","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"Manning College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5138-3182","authenticated-orcid":false,"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Nanjing University, Nanjing, United States"}],"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":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shenzhen, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7808-7375","authenticated-orcid":false,"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"Manning College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref2","volume-title":"Avito Context Ad Clicks","year":"2015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.65109\/zeze1109"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2008.060184"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155231"},{"key":"ref6","first-page":"2016","article-title":"Cooperative multi-player bandit optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Bistritz"},{"key":"ref7","article-title":"Bandits games and clustering foundations","author":"Bubeck","year":"2010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218651"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/24"},{"key":"ref10","first-page":"3471","article-title":"The gossiping insert-eliminate algorithm for multi-agent bandits","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Chawla"},{"key":"ref11","first-page":"3903","article-title":"On-demand communication for asynchronous multi-agent bandits","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Chen"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2972698"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3218527"},{"key":"ref14","first-page":"2730","article-title":"Cooperative multi-agent bandits with heavy tails","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dubey"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2780087"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16901"},{"key":"ref17","first-page":"1901","article-title":"Decentralized exploration in multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"F\u00e9raud"},{"key":"ref18","first-page":"503","article-title":"Batched multi-armed bandits problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gao"},{"key":"ref19","first-page":"784","article-title":"On explore-then-commit strategies","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Garivier"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/app12157424"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.100213.130672"},{"key":"ref22","first-page":"5065","article-title":"Almost optimal anytime algorithm for batched multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Jin"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i12.29206"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2852361"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798264"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2409172"},{"key":"ref29","article-title":"Distributed multi-agent bandits over Erdos\u2013R\u00e9nyi random networks","author":"Liu","journal-title":"arXiv:2510.22811"},{"key":"ref30","article-title":"When to call your neighbor? Strategic communication in cooperative stochastic bandits","author":"Madhushani","year":"2021","journal-title":"arXiv:2110.04396"},{"key":"ref31","first-page":"4529","article-title":"Decentralized cooperative stochastic bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Mart\u00ednez-Rubio"},{"key":"ref32","first-page":"1211","article-title":"A practical algorithm for multiplayer bandits when arm means vary among players","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Boursier"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1381"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2678021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17156"},{"key":"ref36","first-page":"2917","article-title":"Federated multi-armed bandits with personalization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shi"},{"key":"ref37","first-page":"22392","article-title":"Heterogeneous multi-player multi-armed bandits: Closing the gap and generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Shi"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3118091"},{"key":"ref39","first-page":"19","article-title":"Gossip-based distributed stochastic bandit algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"28","author":"Sz\u00f6r\u00e9nyi"},{"issue":"135","key":"ref40","first-page":"1","article-title":"Optimal and efficient algorithms for decentralized online convex optimization","volume":"26","author":"Wan","year":"2024","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","first-page":"4120","article-title":"Optimal algorithms for multiplayer multi-armed bandits","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","volume":"108","author":"Wang"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3744970.3727272"},{"key":"ref43","article-title":"Achieve near-optimal individual regret & low communications in multi-agent bandits","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Wang"},{"key":"ref44","first-page":"1","article-title":"Distributed bandit learning: Near-optimal regret with efficient communication","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Wang"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2740211"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796901"},{"key":"ref47","first-page":"8885","article-title":"Cooperative stochastic bandits with asynchronous agents and constrained feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Yang"},{"key":"ref48","article-title":"Federated multi-armed bandits with efficient bit-level communications","volume-title":"Proc. 39th Annu. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref49","article-title":"Decentralized upper confidence bound algorithms for homogeneous multi-agent multi-armed bandits","author":"Zhu","year":"2021","journal-title":"arXiv:2111.10933"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11414221.pdf?arnumber=11414221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:49:07Z","timestamp":1772657347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11414221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/ton.2026.3662342","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}