{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:22Z","timestamp":1725740482902},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/wcnc.2018.8377070","type":"proceedings-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T23:24:55Z","timestamp":1528759495000},"page":"1-6","source":"Crossref","is-referenced-by-count":6,"title":["Aggregation of multi-armed bandits learning algorithms for opportunistic spectrum access"],"prefix":"10.1109","author":[{"given":"Lilian","family":"Besson","sequence":"first","affiliation":[]},{"given":"Emilie","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Moy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1499-2012-26"},{"key":"ref12","first-page":"570","article-title":"Adaptive Bandits: Towards the best history-dependent strategy","author":"maillard","year":"2011","journal-title":"AISTATS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref15","first-page":"39","article-title":"Analysis of Thompson sampling for the Multi-Armed Bandit problem","author":"agrawal","year":"2012","journal-title":"JMLR Conference On Learning Theory"},{"key":"ref16","first-page":"199","author":"kaufmann","year":"2012","journal-title":"Thompson Sampling an Asymptotically Optimal Finite-Time Analysis"},{"key":"ref17","article-title":"Corralling a Band of Bandit Algorithms","author":"agarwal","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"Learning to Use Learners' Advice","author":"singla","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref19","article-title":"Efficient Contextual Bandits in Non-stationary Worlds","author":"luo","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.361604"},{"key":"ref8","first-page":"359","article-title":"The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond","author":"garivier","year":"2011","journal-title":"COLT"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.839380"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/98.788210"},{"key":"ref9","first-page":"592","article-title":"On Bayesian Upper Confidence Bounds for Bandit Problems","author":"kaufmann","year":"2012","journal-title":"AISTATS"}],"event":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","start":{"date-parts":[[2018,4,15]]},"location":"Barcelona","end":{"date-parts":[[2018,4,18]]}},"container-title":["2018 IEEE Wireless Communications and Networking Conference (WCNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8370761\/8376943\/08377070.pdf?arnumber=8377070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T01:17:04Z","timestamp":1530580624000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8377070\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2018.8377070","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}