{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:22:40Z","timestamp":1771514560798,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"name":"H2020 Marie Sklodowska-Curie Actions","award":["754412"],"award-info":[{"award-number":["754412"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2020,7,1]]},"DOI":"10.1109\/tnse.2019.2935256","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T20:17:46Z","timestamp":1565813866000},"page":"1453-1465","source":"Crossref","is-referenced-by-count":3,"title":["Multi-Armed Bandits on Partially Revealed Unit Interval Graphs"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7515-8863","authenticated-orcid":false,"given":"Xiao","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7085-1191","authenticated-orcid":false,"given":"Sattar","family":"Vakili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9590-4285","authenticated-orcid":false,"given":"Qing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananthram","family":"Swami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.4064\/fm-51-1-45-64"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/aama.1994.1009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00046-F"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90156-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/188"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935878"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2307\/3212956"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810607"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0446"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10998-010-3055-6"},{"key":"ref11","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"abbasi-yadkori","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","first-page":"46","article-title":"Spectral bandits for smooth graph functions","author":"valko","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7179041"},{"key":"ref14","first-page":"142","article-title":"Leveraging side observations in stochastic bandits","author":"caron","year":"2012","journal-title":"Proc 28th Conf Uncertainty Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2591989"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/140989455"},{"key":"ref17","article-title":"École normale supérieure de Cachan-ENS Cachan","author":"valko","year":"2016","journal-title":"Bandits on graphs and structures"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992237273"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"ref28","first-page":"1","article-title":"Analysis of thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2013.2263494"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref3","first-page":"359","article-title":"The KL-UCB algorithm for bounded stochastic bandits and beyond","author":"garivier","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2181864"},{"key":"ref29","first-page":"99","article-title":"Further optimal regret bounds for thompson sampling","author":"agrawal","year":"0","journal-title":"Proc Artif Intell Statist"},{"key":"ref5","first-page":"232","article-title":"Adaptive shortest-path routing under unknown and stochastically varying link states","author":"liu","year":"0","journal-title":"Proc IEEE Int Symp Model Optim Mobile Ad Hoc Wireless Netw"},{"key":"ref8","first-page":"535","article-title":"Tight regret bounds for stochastic combinatorial semi-bandits","author":"kveton","year":"0","journal-title":"Proc Artif Intell Statist"},{"key":"ref7","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework, results and applications","author":"chen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref9","first-page":"355","article-title":"Stochastic linear optimization under bandit feedback","author":"dani","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref20","first-page":"975","article-title":"Lipschitz bandits: Regret lower bound and optimal algorithms","author":"magureanu","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref22","first-page":"521","article-title":"Unimodal bandits: Regret lower bounds and optimal algorithms","author":"combes","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","first-page":"1602","article-title":"Multi-armed bandits on implicit metric spaces","author":"slivkins","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"817","article-title":"The Epoch–Greedy algorithm for multi-armed bandits with side information","author":"langford","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"1763","article-title":"Minimal exploration in structured stochastic bandits","author":"combes","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref25","first-page":"2249","article-title":"An empirical evaluation of Thompson sampling","author":"chapelle","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9184321\/08798887.pdf?arnumber=8798887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:25:16Z","timestamp":1651080316000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8798887\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2019.2935256","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,1]]}}}