{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:39:21Z","timestamp":1763811561072,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["61931023"],"award-info":[{"award-number":["61931023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tcomm.2024.3434960","type":"journal-article","created":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T19:31:28Z","timestamp":1722281488000},"page":"292-302","source":"Crossref","is-referenced-by-count":1,"title":["Toward Order Optimal Channel Access in Unknown Environments: An Online Learning Method"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4487-7115","authenticated-orcid":false,"given":"Shuai","family":"Ye","sequence":"first","affiliation":[{"name":"School of Electronic Science and Engineering, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0143-556X","authenticated-orcid":false,"given":"Shaowei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electronic Science and Engineering, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TCCN.2023.3238892"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/COMST.2015.2401597"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TII.2019.2953246"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/JSAC.2004.839380"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/LCOMM.2019.2941717"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/JIOT.2022.3190523"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/GLOBECOM48099.2022.10000684"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/APSCON56343.2023.10101010"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TWC.2019.2950197"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TAC.2021.3077454"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref12","first-page":"56","article-title":"Multi-player bandits revisited","volume-title":"Proc. Algorithmic Learn. Theory","author":"Besson"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2012.2198613"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TSP.2015.2391072"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2021.3136095"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TIT.2012.2230215"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TSP.2014.2360821"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TCCN.2017.2675901"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TCCN.2023.3237578"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TCCN.2022.3149113"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TWC.2016.2524638"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/TWC.2021.3119204"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TITS.2020.3041647"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TWC.2020.3028857"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TWC.2021.3091588"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1023\/A:1013689704352"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TCOMM.2021.3066002"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1016\/0196-8858(85)90002-8"},{"volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zimmert","article-title":"Connections between mirror descent, Thompson sampling, and the information ratio","key":"ref29"},{"key":"ref30","first-page":"217","article-title":"Minimax policies for adversarial and stochastic bandits","volume-title":"Proc. Int. Conf. Comput. Learn. Theory","author":"Audibert"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1561\/2200000024"},{"key":"ref32","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kveton"},{"key":"ref33","first-page":"5114","article-title":"Thompson sampling for combinatorial semi-bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1137\/S0097539701398375"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1017\/9781108571401"},{"issue":"28","key":"ref36","first-page":"1","article-title":"Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits","volume":"22","author":"Zimmert","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref37","first-page":"116","article-title":"An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits","volume-title":"Proc. Int. Conf. Comput. Learn. Theory","author":"Auer"},{"key":"ref38","first-page":"1263","article-title":"More adaptive algorithms for adversarial bandits","volume-title":"Proc. Int. Conf. Comput. Learn. Theory","author":"Wei"},{"volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Abernethy","article-title":"Fighting bandits with a new kind of smoothness","key":"ref39"},{"key":"ref40","first-page":"12","article-title":"Corralling a band of bandit algorithms","volume-title":"Proc. Int. Conf. Comput. Learn. Theory","author":"Agarwal"},{"key":"ref41","first-page":"39.1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Agrawal"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/10843061\/10613831.pdf?arnumber=10613831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:51:34Z","timestamp":1737399094000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10613831\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":41,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3434960","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}