{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T19:25:58Z","timestamp":1774380358114,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/tnet.2011.2181864","type":"journal-article","created":{"date-parts":[[2012,3,9]],"date-time":"2012-03-09T20:26:05Z","timestamp":1331324765000},"page":"1466-1478","source":"Crossref","is-referenced-by-count":247,"title":["Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations"],"prefix":"10.1109","volume":"20","author":[{"given":"Yi","family":"Gai","sequence":"first","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Jain","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511703799.010"},{"key":"ref33","author":"ford","year":"1956","journal-title":"Network flow theory"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quart Appl Math"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.2307\/2033241"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/9780471703778"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-004-0048-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/17442509008833627"},{"key":"ref12","first-page":"1","article-title":"Decentralized online learning algorithms for opportunistic spectrum access","author":"gai","year":"2011","journal-title":"Proc IEEE Globecom"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1987.1104485"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935068"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946895"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946273"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120191"},{"key":"ref18","first-page":"1","article-title":"On the combinatorial multi-armed bandit problem with Markovian rewards","author":"gai","year":"2011","journal-title":"Proc IEEE Globecom"},{"key":"ref19","first-page":"203","article-title":"Exploiting similarity information in reinforcement learning","author":"ortner","year":"2010","journal-title":"Proc 2nd ICAART"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.918109"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110406"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830909"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1987.1104485"},{"key":"ref8","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134736"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273587"},{"key":"ref9","author":"korte","year":"2008","journal-title":"Combinatorial Optimization Theory and Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738680"},{"key":"ref22","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume":"3","author":"auer","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0446"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"ref23","first-page":"355","article-title":"Stochastic linear optimization under bandit feedback","author":"dani","year":"2008","journal-title":"Proc 21st Annu COLT"},{"key":"ref26","author":"pollard","year":"1984","journal-title":"Convergence of Stochastic Processes"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2010.5457857"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6329526\/06166915.pdf?arnumber=6166915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:43Z","timestamp":1633909963000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6166915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":38,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2011.2181864","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}