{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:44:51Z","timestamp":1782834291910,"version":"3.54.5"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&#x0026;D Program of China","award":["2021YFB2900200"],"award-info":[{"award-number":["2021YFB2900200"]}]},{"name":"NSF China","award":["62171159"],"award-info":[{"award-number":["62171159"]}]},{"name":"Guangdong Science and Technology Planning","award":["2018B030322004"],"award-info":[{"award-number":["2018B030322004"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002402","name":"Sun Yat-sen University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002402","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2023,9,1]]},"DOI":"10.1109\/tmc.2022.3173792","type":"journal-article","created":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T19:43:20Z","timestamp":1652211800000},"page":"5346-5358","source":"Crossref","is-referenced-by-count":13,"title":["Learning With Guarantee Via Constrained Multi-Armed Bandit: Theory and Network Applications"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4354-0843","authenticated-orcid":false,"given":"Kechao","family":"Cai","sequence":"first","affiliation":[{"name":"School of Electronics and Communication Engineering, Sun Yat-Sen University, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8628-5873","authenticated-orcid":false,"given":"Xutong","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1420-9214","authenticated-orcid":false,"given":"Yu-Zhen Janice","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"ref35","first-page":"1","article-title":"Continuous control with deep reinforcement learning","author":"lillicrap","year":"2016","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602844"},{"key":"ref34","first-page":"746","article-title":"A simple approach for non-stationary linear bandits","author":"zhao","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref15","first-page":"12071","article-title":"SIC-MMAB: Synchronisation involves communication in multiplayer multi-armed bandits","author":"boursier","year":"2019","journal-title":"Proc 33rd Int Conf Adv Neural Inf Process Syst"},{"key":"ref37","author":"puterman","year":"2014","journal-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL0521340446.006"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2200\/S00268ED1V01Y201005AIM009"},{"key":"ref31","first-page":"1690","article-title":"An optimal algorithm for the thresholding bandit problem","author":"locatelli","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref30","first-page":"4","article-title":"An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives","author":"agrawal","year":"2016","journal-title":"Proc 29th Conf Learn Theory"},{"key":"ref11","article-title":"Algorithm implementations of learning with guarantee via constrained multi-armed bandit","author":"cai","year":"0"},{"key":"ref33","first-page":"199","article-title":"Stochastic multi-armed-bandit problem with non-stationary rewards","author":"gur","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147956"},{"key":"ref32","first-page":"1","article-title":"Online decision making under stochastic constraints","author":"mahdavi","year":"2012","journal-title":"Proc NIPS Workshop Discrete Optim Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155518"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2158673"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195522"},{"key":"ref39","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2183771"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10187.001.0001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3123024.3124402"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2746285.2746287"},{"key":"ref24","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":"ref23","first-page":"199","article-title":"Stochastic multi-armed-bandit problem with non-stationary rewards","author":"besbes","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref26","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework, results and applications","author":"chen","year":"2013","journal-title":"Proc 30th Int Conf Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_30"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2943468"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485906"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2879459"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155234"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1201\/b18058"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3082927"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2796314.2745847"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8637"},{"key":"ref29","first-page":"2210","article-title":"Budgeted multi-armed bandits with multiple plays","author":"xia","year":"2016","journal-title":"Proc 25th Int Joint Conf Artif Intell"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2424413"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2014.6990328"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2418191"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.59"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2652061"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488896"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7755\/10209076\/09772426.pdf?arnumber=9772426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T20:26:37Z","timestamp":1736972797000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9772426\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":44,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2022.3173792","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,1]]}}}