{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:04:46Z","timestamp":1775228686271,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Fellowship Award from the Research Grants Council (RGC) of Hong Kong Special Administrative Region, China","award":["CUHK PDFS2324-4S04"],"award-info":[{"award-number":["CUHK PDFS2324-4S04"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62476261"],"award-info":[{"award-number":["62476261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"RGC","award":["GRF-14202923"],"award-info":[{"award-number":["GRF-14202923"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/ton.2024.3519568","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T19:18:14Z","timestamp":1735931894000},"page":"982-993","source":"Crossref","is-referenced-by-count":3,"title":["Variance-Aware Bandit Framework for Dynamic Probabilistic Maximum Coverage Problem With Triggered or Self-Reliant Arms"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0179-196X","authenticated-orcid":false,"given":"Xiangxiang","family":"Dai","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xutong","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhang","family":"Zuo","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Shatin, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7935-7210","authenticated-orcid":false,"given":"Hong","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0785-9291","authenticated-orcid":false,"given":"Carlee","family":"Joe-Wong","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA"}],"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, Shatin, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"1746","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"Chen","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2870521"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2370216.2370288"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6187"},{"key":"ref5","first-page":"1650","article-title":"Near-optimal observation selection using submodular functions","volume-title":"Proc. AAAI","author":"Krause"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2876823"},{"key":"ref7","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref8","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","volume-title":"Proc. AISTATS","author":"Kveton"},{"key":"ref9","first-page":"1245","article-title":"Contextual combinatorial cascading bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref10","first-page":"14904","article-title":"Batch-size independent regret bounds for combinatorial semi-bandits with probabilistically triggered arms or independent arms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Liu"},{"key":"ref11","first-page":"3247","article-title":"Contextual combinatorial multi-armed bandits with volatile arms and submodular reward","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Chen"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228940"},{"key":"ref13","first-page":"8","article-title":"Volatile multi-armed bandits for guaranteed targeted social crawling","volume-title":"Proc. 27th AAAI Conf. Artif. Intell.","author":"Bnaya"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/17-ECP92"},{"key":"ref15","first-page":"1161","article-title":"Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Wang"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"key":"ref18","first-page":"2116","article-title":"Combinatorial bandits revisited","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Combes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref20","first-page":"384","article-title":"Tight bounds for the expected risk of linear classifiers and PAC-Bayes finite-sample guarantees","volume-title":"Proc. Artif. Intell. Statist.","author":"Honorio"},{"key":"ref21","first-page":"2830","article-title":"Tight lower bounds for combinatorial multi-armed bandits","volume-title":"Proc. Conf. Learn. Theory","author":"Merlis"},{"key":"ref22","first-page":"2465","article-title":"Batch-size independent regret bounds for the combinatorial multi-armed bandit problem","volume-title":"Proc. Conf. Learn. Theory","author":"Merlis"},{"key":"ref23","first-page":"3275","article-title":"Risk-aversion in multi-armed bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"25","author":"Sani"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2592622"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3641512.3686368"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2726820"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3275851"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3664647.3681269"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2941482"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3423442"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3173792"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_5"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS61813.2024.10682895"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485906"},{"key":"ref35","volume-title":"Multichannel Dqn Channel Model","author":"Wang","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3448250"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.016"},{"key":"ref43","first-page":"7057","article-title":"Multi-layered network exploration via random walks: From offline optimization to online learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375835"},{"key":"ref45","first-page":"11472","article-title":"Online competitive influence maximization","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Zuo"},{"key":"ref46","first-page":"4532","article-title":"Nearly minimax optimal reinforcement learning for linear mixture Markov decision processes","volume-title":"Proc. Conf. Learn. Theory","author":"Zhou"},{"key":"ref47","first-page":"4342","article-title":"Improved variance-aware confidence sets for linear bandits and linear mixture MDP","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Zhang"},{"key":"ref48","first-page":"29126","article-title":"Minimax regret for cascading bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Vial"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref50","first-page":"1450","article-title":"Combinatorial cascading bandits","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Kveton"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/10723154\/11039001\/10821481-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11039001\/10821481.pdf?arnumber=10821481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:37:16Z","timestamp":1750268236000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10821481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/ton.2024.3519568","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}