{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:30Z","timestamp":1773378090226,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2640\/20"],"award-info":[{"award-number":["2640\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518237","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2702-2707","source":"Crossref","is-referenced-by-count":4,"title":["Online Learning for Shortest Path and Backpressure Routing in Wireless Networks"],"prefix":"10.1109","author":[{"given":"Omer","family":"Amar","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev,Beer-Sheva,Israel,84105"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobi","family":"Cohen","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev,Beer-Sheva,Israel,84105"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","article-title":"Online learning for shortest path and backpressure routing in wireless networks (extended version)","author":"amar","year":"2021","journal-title":"link to the exteded version in the dropbox folder"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2018.2809722"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref31","first-page":"1054","article-title":"Sample mean based index policies with o (log n) regret for the multi-armed bandit problem","author":"agrawal","year":"0","journal-title":"Advances in Applied Probability"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.016"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638236"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2879433"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904329"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2747409"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139565844"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2623317"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879361"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062262"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2094204"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2783846"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080905"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2200\/S00330ED1V01Y201101CNT009"},{"key":"ref28","first-page":"1183","article-title":"Restless hidden markov bandit with linear rewards","author":"yemini","year":"0","journal-title":"IEEE Conference on Decision and Control (CDC)"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/s10776-019-00463-6","article-title":"A survey and performance evaluation of reinforcement learning based spectrum aware routing in cognitive radio ad hoc networks","volume":"27","author":"raj","year":"2020","journal-title":"International Journal of Wireless Information Networks"},{"key":"ref27","article-title":"Exploiting relevance for online decision-making in high-dimensions","author":"turgay","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2019.102035"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2010.5457857"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437583"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928977"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.361604"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888200"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849327"},{"key":"ref9","first-page":"232","article-title":"Adaptive shortest-path routing under unknown and stochastically varying link states","author":"liu","year":"2012","journal-title":"Int Symp on Modeling and Optimization in Mobile Ad Hoc and Wireless Networks (WiOPT)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-018-1672-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2431121"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868440"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2626578"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2198613"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935068"},{"key":"ref26","first-page":"7222","article-title":"Distributed multi-player bandits-a game of thrones approach","author":"bistritz","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2230215"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518237.pdf?arnumber=9518237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:14Z","timestamp":1773347774000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518237","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}