{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:58:56Z","timestamp":1730195936286,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,27]]},"DOI":"10.1109\/allerton49937.2022.9929355","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T21:34:30Z","timestamp":1667597670000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Bandits with Dynamic Arm-acquisition Costs"],"prefix":"10.1109","author":[{"given":"Anand","family":"Kalvit","sequence":"first","affiliation":[{"name":"Columbia University"}]},{"given":"Assaf","family":"Zeevi","sequence":"additional","affiliation":[{"name":"Columbia University"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/3214163"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/3214547"},{"key":"ref12","article-title":"An asymptotically optimal index policy for finite-horizon restless bandits","author":"hu","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/apr.2019.29"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3342"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref17","first-page":"343","article-title":"Adapting to a changing environment: the brownian restless bandits","author":"slivkins","year":"2008","journal-title":"COLT"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_16"},{"key":"ref19","first-page":"199","article-title":"Stochastic multi-armed-bandit problem with non-stationary rewards","volume":"27","author":"besbes","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref28","article-title":"What doubling tricks can and can't do for multi-armed bandits","author":"besson","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref4","first-page":"8259","article-title":"From finite to countable-armed bandits","volume":"33","author":"kalvit","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.5705\/ss.202020.0242"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1069362389"},{"key":"ref6","first-page":"39","article-title":"Analysis of thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"2012","journal-title":"Conference on Learning Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2013"},{"key":"ref8","first-page":"22 457","article-title":"Bandits with many optimal arms","volume":"34","author":"de heide","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref9","first-page":"241","article-title":"A dynamic allocation index for the sequential design of experiments","author":"gittins","year":"1974","journal-title":"Progress in Statistics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref20","first-page":"3074","article-title":"Rotting bandits","volume":"30","author":"levine","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref22","first-page":"1168","article-title":"Stochastic bandits with delay-dependent payoffs","author":"cella","year":"2020","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00037"},{"key":"ref24","first-page":"1729","article-title":"Algorithms for infinitely many-armed bandits","author":"wang","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2019.0033"},{"key":"ref26","first-page":"1133","article-title":"Simple regret for infinitely many armed bandits","author":"carpentier","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref25","first-page":"2184","article-title":"Two-target algorithms for infinite-armed bandits with bernoulli rewards","author":"bonald","year":"2013","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2022,9,27]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2022,9,30]]}},"container-title":["2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9929313\/9929314\/09929355.pdf?arnumber=9929355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:05:07Z","timestamp":1672427107000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9929355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/allerton49937.2022.9929355","relation":{},"subject":[],"published":{"date-parts":[[2022,9,27]]}}}