{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:07:56Z","timestamp":1740132476927,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ONR","award":["N00014-19-1-2566"],"award-info":[{"award-number":["N00014-19-1-2566"]}]},{"name":"NSF","award":["SATC 1704778"],"award-info":[{"award-number":["SATC 1704778"]}]},{"name":"ARO","award":["W911NF-17-1-0359"],"award-info":[{"award-number":["W911NF-17-1-0359"]}]},{"name":"NSA SoS Lablet","award":["H98230-18-D-0007"],"award-info":[{"award-number":["H98230-18-D-0007"]}]},{"name":"WNCG Industrial Affiliates Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tac.2022.3179521","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:41:47Z","timestamp":1654098107000},"page":"2667-2682","source":"Crossref","is-referenced-by-count":1,"title":["Multiagent Low-Dimensional Linear Bandits"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1769-2651","authenticated-orcid":false,"given":"Ronshee","family":"Chawla","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3309-8652","authenticated-orcid":false,"given":"Abishek","family":"Sankararaman","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4325-9050","authenticated-orcid":false,"given":"Sanjay","family":"Shakkottai","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}]}],"member":"263","reference":[{"key":"ref13","first-page":"355","article-title":"Stochastic linear optimization under bandit feedback","author":"dani","year":"0","journal-title":"Proc 21st Annu Conf Learn Theory"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1287\/opre.2019.1902"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/3366701"},{"key":"ref14","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"abbasi-yadkori","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/1806689.1806745"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/1772690.1772758"},{"key":"ref10","first-page":"4531","article-title":"Decentralized cooperative stochastic bandits","author":"mart\u00ednez-rubio","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/1553374.1553527"},{"key":"ref1","first-page":"273","article-title":"Mortal multi-armed bandits","author":"chakrabarti","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TNET.2018.2852361"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.24963\/ijcai.2017\/24"},{"key":"ref19","first-page":"4120","article-title":"Optimal algorithms for multiplayer multi-armed bandits","author":"wang","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/3466772.3467045"},{"key":"ref24","first-page":"377","article-title":"Sparsity regret bounds for individual sequences in online linear regression","author":"gerchinovitz","year":"0","journal-title":"Proc 24th Annu Conf Learn Theory JMLR Workshop Conf"},{"key":"ref23","first-page":"190","article-title":"Bandit theory meets compressed sensing for high dimensional stochastic linear bandit","author":"carpentier","year":"0","journal-title":"Proc Artif Intell Statist"},{"key":"ref26","article-title":"Distributed bandit learning: Near-optimal regret with efficient communication","author":"wang","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref25","first-page":"1","article-title":"Online-to-confidence-set conversions and application to sparse stochastic bandits","author":"abbasi-yadkori","year":"0","journal-title":"Proc Artif Intell Statist"},{"year":"2016","author":"agarwal","article-title":"Making contextual decisions with low technical debt","key":"ref20"},{"year":"2019","author":"lale","article-title":"Stochastic linear bandits with hidden low rank structure","key":"ref22"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/978-3-319-51394-2_25"},{"key":"ref28","first-page":"6003","article-title":"Differentially-private federated linear bandits","volume":"33","author":"dubey","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref27","first-page":"1301","article-title":"Distributed clustering of linear bandits in peer to peer networks","author":"korda","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1609\/aaai.v35i8.16820"},{"key":"ref8","first-page":"12048","article-title":"SIC-MMAB: Synchronisation involves communication in multiplayer multi-armed bandits","author":"boursier","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","first-page":"7222","article-title":"Distributed multi-player bandits–A Game of Thrones approach","author":"bistritz","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","first-page":"3471","article-title":"The gossiping insert-eliminate algorithm for multi-agent bandits","author":"chawla","year":"0","journal-title":"Proc 23rd Int Conf Artif Intell Statist"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1017\/9781108571401"},{"key":"ref3","first-page":"854","article-title":"Distributed exploration in multi-armed bandits","author":"hillel","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/INFOCOM.2015.7218651"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1561\/2200000024"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10109211\/9786669-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10109211\/09786669.pdf?arnumber=9786669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T15:07:13Z","timestamp":1684163233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9786669\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3179521","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"type":"print","value":"0018-9286"},{"type":"electronic","value":"1558-2523"},{"type":"electronic","value":"2334-3303"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}