{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T01:40:25Z","timestamp":1740274825818,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["22ZR1441700"],"award-info":[{"award-number":["22ZR1441700"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&D Program of China","award":["2024YFE0200500"],"award-info":[{"award-number":["2024YFE0200500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tnse.2024.3524362","type":"journal-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:35:31Z","timestamp":1735587331000},"page":"1126-1136","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Dueling Bandits for Edge Intelligence"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0996-5380","authenticated-orcid":false,"given":"Shangshang","family":"Wang","sequence":"first","affiliation":[{"name":"Viterbi School of Engineering, University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8774-1391","authenticated-orcid":false,"given":"Ziyu","family":"Shao","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0608-9408","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279518"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.028"},{"key":"ref5","first-page":"241","article-title":"Beat the mean bandit","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yue","year":"2011"},{"key":"ref6","first-page":"91","article-title":"Generic exploration and k-armed voting bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Urvoy","year":"2013"},{"key":"ref7","first-page":"856","article-title":"Reducing dueling bandits to cardinal bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ailon","year":"2014"},{"key":"ref8","first-page":"10","article-title":"Relative upper confidence bound for the k-armed dueling bandit problem","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zoghi","year":"2014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556256"},{"key":"ref10","first-page":"1141","article-title":"Regret lower bound and optimal algorithm in dueling bandit problem","volume-title":"Proc. Conf. Learn. Theory","author":"Komiyama","year":"2015"},{"key":"ref11","first-page":"416","article-title":"Sparse dueling bandits","volume-title":"Proc. Artif. Intell. Statist.","author":"Jamieson","year":"2015"},{"key":"ref12","first-page":"307","article-title":"Copeland dueling bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zoghi","year":"2015"},{"key":"ref13","first-page":"563","article-title":"Contextual dueling bandits","volume-title":"Proc. Conf. Learn. Theory","author":"Dudk","year":"2015"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737461"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3072115"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10000778"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1229179.1229181"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/776"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/14207.001.0001"},{"key":"ref20","article-title":"Borda regret minimization for generalized linear dueling bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu","year":"2024"},{"key":"ref21","first-page":"217","article-title":"Minimax policies for adversarial and stochastic bandits","volume-title":"Proc. Annu. Conf. Learn. Theory","author":"Audibert","year":"2009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3088510"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2200\/s00271ed1v01y201006cnt007"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"article-title":"Optimally confident UCB: Improved regret for finite-armed bandits","year":"2015","author":"Lattimore","key":"ref25"},{"key":"ref26","first-page":"1213","article-title":"Learning community-based preferences via Dirichlet process mixtures of Gaussian processes","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Abbasnejad","year":"2013"},{"article-title":"Introducing LETOR 4.0 datasets","year":"2013","author":"Qin","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33015549"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/10899093\/10818641.pdf?arnumber=10818641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:49:51Z","timestamp":1740203391000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10818641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2024.3524362","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}