{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:58:28Z","timestamp":1775815108279,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Information Technology Research Academy (ITRA), Media Labs Asia, through the De-congesting India\u2019s transportation networks Project"},{"name":"DST INSPIRE Faculty","award":["IFA13-ENG-69"],"award-info":[{"award-number":["IFA13-ENG-69"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tnet.2018.2852361","type":"journal-article","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T18:18:00Z","timestamp":1532369880000},"page":"1782-1795","source":"Crossref","is-referenced-by-count":31,"title":["Collaborative Learning of Stochastic Bandits Over a Social Network"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6998-4234","authenticated-orcid":false,"given":"Ravi Kumar","family":"Kolla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4436-5103","authenticated-orcid":false,"given":"Krishna","family":"Jagannathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7323-2975","authenticated-orcid":false,"given":"Aditya","family":"Gopalan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"abbasi-yadkori","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17142-5_14"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160719"},{"key":"ref32","first-page":"280","article-title":"Prediction with limited advice and multiarmed bandits with paid observations","author":"seldin","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref31","first-page":"107","article-title":"Multiarmed bandits with limited expert advice","author":"kale","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref30","first-page":"2490","article-title":"Budgeted prediction with expert advice","author":"amin","year":"2015","journal-title":"Proc AAAI"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1038\/srep06308","article-title":"Dominating scale-free networks using generalized probabilistic methods","volume":"4","author":"moln\u00e1r","year":"2014","journal-title":"Sci Rep"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"37r","DOI":"10.37236\/1581","article-title":"On the domination number of a random graph","volume":"8","author":"wieland","year":"2001","journal-title":"Electron J Combinatorics"},{"key":"ref35","author":"kuhn","year":"2013","journal-title":"Lecture Notes Network Algorithms Summer Term"},{"key":"ref34","article-title":"Jeux de bandits et fondations du clustering","author":"bubeck","year":"2010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1561\/9781601986276","author":"bubeck","year":"2012","journal-title":"Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2062509"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462144"},{"key":"ref14","author":"nayyar","year":"2015","journal-title":"Decentralized Learning for Multi-player Multi-armed Bandits"},{"key":"ref15","author":"liu","year":"2015","journal-title":"Regret vs Communication Distributed stochastic multi-armed bandits and beyond"},{"key":"ref16","first-page":"854","article-title":"Distributed exploration in multi-armed bandits","author":"hillel","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2016.7732984"},{"key":"ref18","first-page":"260","article-title":"Distributed non-stochastic experts","author":"kanade","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","author":"cesa-bianchi","year":"2016","journal-title":"Delay and cooperation in nonstochastic bandits"},{"key":"ref28","author":"alon","year":"2015","journal-title":"Online learning with feedback graphs Beyond bandits"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2004.1389878"},{"key":"ref27","first-page":"684","article-title":"From bandits to experts: On the value of side-observations","author":"mannor","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2013.2295036"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5979826"},{"key":"ref29","first-page":"613","article-title":"Efficient learning by implicit exploration in bandit problems with side observations","author":"koc\u00e1k","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2012.2183069"},{"key":"ref8","author":"agrawal","year":"2011","journal-title":"Analysis of thompson sampling for the multi-armed bandit problem"},{"key":"ref7","author":"haynes","year":"1998","journal-title":"Fundamentals of Domination in Graphs"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/1427934"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref20","first-page":"19","article-title":"Gossip-based distributed stochastic bandit algorithms","author":"szorenyi","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ECC.2016.7810293"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/24"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6761049"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798264"},{"key":"ref26","author":"caron","year":"2012","journal-title":"Leveraging side observations in stochastic bandits"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218651"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8438336\/08418308.pdf?arnumber=8418308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T22:32:29Z","timestamp":1693780349000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8418308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":40,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2018.2852361","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}