{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:48:17Z","timestamp":1740181697459,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2002902","ECCS-2029978"],"award-info":[{"award-number":["CNS-2002902","ECCS-2029978"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Commonwealth Cyber Initiative (CCI) Cybersecurity Research Collaboration Grant"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/jsait.2021.3076027","type":"journal-article","created":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:51:06Z","timestamp":1619556666000},"page":"515-533","source":"Crossref","is-referenced-by-count":4,"title":["On No-Sensing Adversarial Multi-Player Multi-Armed Bandits With Collision Communications"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2727-8251","authenticated-orcid":false,"given":"Chengshuai","family":"Shi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3148-4453","authenticated-orcid":false,"given":"Cong","family":"Shen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91125-1"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276893"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_30"},{"key":"ref31","first-page":"173","article-title":"Multi-armed bandit learning in IoT networks: Learning helps even in non-stationary settings","author":"bonnefoi","year":"2017","journal-title":"Proc 2nd Int Conf Cogn Radio Oriented Wireless Netw Commun"},{"key":"ref30","first-page":"72","article-title":"How effective is the IEEE 802.11 RTS\/CTS handshake in ad hoc networks","volume":"1","author":"xu","year":"2002","journal-title":"Proc IEEE Global Telecommun Conf"},{"journal-title":"Error Control Coding","year":"2004","author":"lin","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023694"},{"key":"ref35","first-page":"1747","article-title":"Online bandit learning against an adaptive adversary: From regret to policy regret","author":"arora","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1561\/2200000044"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2966599"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2929936"},{"key":"ref12","first-page":"1","article-title":"Multi-player bandits: The adversarial case","volume":"21","author":"alatur","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref13","first-page":"155","article-title":"Multi-player bandits—A musical chairs approach","author":"rosenski","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682263"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1987.1104491"},{"key":"ref16","first-page":"1152","article-title":"Optimal regret analysis of Thompson sampling in stochastic multi-armed bandit problem with multiple plays","author":"komiyama","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref17","first-page":"4120","article-title":"Optimal algorithms for multiplayer multi-armed bandits","author":"wang","year":"2020","journal-title":"Proc Int Conf Artif Intell Stat"},{"journal-title":"Multiplayer multi-armed bandits for optimal assignment in heterogeneous networks","year":"2019","author":"tibrewal","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048964"},{"key":"ref28","first-page":"605","article-title":"Delay and cooperation in nonstochastic bandits","author":"cesa-bianchi","year":"2016","journal-title":"Proc Conf Learn Theory"},{"journal-title":"Multiplayer bandits without observing collision information","year":"2018","author":"lugosi","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.004"},{"key":"ref3","first-page":"12071","article-title":"SIC-MMAB: Synchronisation involves communication in multiplayer multi-armed bandits","author":"boursier","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"ref5","first-page":"961","article-title":"Non-stochastic multi-player multi-armed bandits: Optimal rate with collision information, sublinear without","author":"bubeck","year":"2020","journal-title":"Proc Conf Learn Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3001388"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_5"},{"key":"ref2","first-page":"56","article-title":"Multi-player bandits revisited","author":"besson","year":"2018","journal-title":"Proc Algorithmic Learn Theory"},{"key":"ref9","first-page":"1519","article-title":"Decentralized multi-player multi-armed bandits with no collision information","author":"shi","year":"2020","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"ref20","first-page":"1211","article-title":"A practical algorithm for multiplayer bandits when arm means vary among players","author":"boursier","year":"2020","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0598"},{"key":"ref21","first-page":"916","article-title":"Coordination without communication: Optimal regret in two players multi-armed bandits","author":"bubeck","year":"2020","journal-title":"Proc Conf Learn Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ECC.2016.7810293"},{"key":"ref23","first-page":"359","article-title":"The KL-UCB algorithm for bounded stochastic bandits and beyond","author":"garivier","year":"2011","journal-title":"Proc 24th Annu Conf Learn Theory"},{"key":"ref26","first-page":"1","article-title":"Distributed bandit learning: Near-optimal regret with efficient communication","author":"wang","year":"2020","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952664"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9459757\/9416568-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9459757\/09416568.pdf?arnumber=9416568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T22:36:31Z","timestamp":1636410991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9416568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":39,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3076027","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}