{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:54:11Z","timestamp":1778860451093,"version":"3.51.4"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,17]]},"DOI":"10.1109\/infocom53939.2023.10228940","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:40:43Z","timestamp":1693330843000},"page":"1-10","source":"Crossref","is-referenced-by-count":7,"title":["Variance-Adaptive Algorithm for Probabilistic Maximum Coverage Bandits with General Feedback"],"prefix":"10.1109","author":[{"given":"Xutong","family":"Liu","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhang","family":"Zuo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Xie","sequence":"additional","affiliation":[{"name":"Chongqing Institute of Green and Intelligent Technology,Chinese Academy of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlee","family":"Joe-Wong","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref35","article-title":"Combinatorial bandits revisited","volume":"28","author":"combes","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"key":"ref34","first-page":"1450","article-title":"Combinatorial cascading bandits","volume":"1","author":"kveton","year":"2015","journal-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems"},{"key":"ref15","first-page":"2830","article-title":"Tight lower bounds for combinatorial multi-armed bandits","author":"merlis","year":"2020","journal-title":"Conference on Learning Theory"},{"key":"ref14","first-page":"2972","article-title":"Combinatorial semi-bandit with known covariance","author":"degenne","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref31","first-page":"11472","article-title":"Online competitive influence maximization","author":"zuo","year":"2022","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375835"},{"key":"ref11","first-page":"1161","article-title":"Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications","author":"wang","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref10","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"2015","journal-title":"AISTATS"},{"key":"ref32","first-page":"7057","article-title":"Multi-layered network exploration via random walks: From offline optimization to online learning","author":"liu","year":"2021","journal-title":"International Conference on Machine Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77887-5_1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/261342.571216"},{"key":"ref17","first-page":"13","article-title":"The next big one: Detecting earthquakes and other rare events from community-based sensors","author":"faulkner","year":"2011","journal-title":"Proceedings of the 10th ACM\/IEEE International Conference on Information Processing in Sensor Networks"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2418191"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2941482"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2370216.2370288"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2577298"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref21","article-title":"Multichannel dqn channel model","author":"wang","year":"2018"},{"key":"ref28","first-page":"2465","article-title":"Batch-size independent regret bounds for the combinatorial multi-armed bandit problem","author":"merlis","year":"2019","journal-title":"Conference on Learning Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.016"},{"key":"ref29","article-title":"Batch-size independent regret bounds for combinatorial semi-bandits with probabilistically triggered arms or independent arms","author":"liu","year":"2022"},{"key":"ref8","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","author":"chen","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2876823"},{"key":"ref9","first-page":"1746","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"chen","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6187"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2011.6069707"},{"key":"ref6","first-page":"1650","article-title":"Near-optimal observation selection using submodular functions","volume":"7","author":"krause","year":"2007","journal-title":"AAAI"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956769"}],"event":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","location":"New York City, NY, USA","start":{"date-parts":[[2023,5,17]]},"end":{"date-parts":[[2023,5,20]]}},"container-title":["IEEE INFOCOM 2023 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10228851\/10228852\/10228940.pdf?arnumber=10228940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:45:10Z","timestamp":1695059110000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10228940\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/infocom53939.2023.10228940","relation":{},"subject":[],"published":{"date-parts":[[2023,5,17]]}}}