{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:06:40Z","timestamp":1778270800882,"version":"3.51.4"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1109\/ciss.2014.6814096","type":"proceedings-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T18:41:30Z","timestamp":1400265690000},"page":"1-6","source":"Crossref","is-referenced-by-count":65,"title":["Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting"],"prefix":"10.1109","author":[{"given":"Kevin","family":"Jamieson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Nowak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","first-page":"638","article-title":"Prior-free and prior-dependent regret bounds for thompson sampling","author":"bubeck","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"13","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"COLT 2010 - Proceedings"},{"key":"14","author":"agrawal","year":"2011","journal-title":"Analysis of Thompson Sampling for the Multiarmed Bandit Problem"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703731"},{"key":"12","author":"kaufmann","year":"2013","journal-title":"Information Complexity in Bandit Subset Selection"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.2307\/2527883"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703739"},{"key":"1","author":"gabillon","year":"2012","journal-title":"Best Arm Identification A Unified Approach to Fixed Budget and Fixed Confidence"},{"key":"10","author":"jamieson","year":"2013","journal-title":"Lil'Ucb An Optimal Exploration Algorithm for Multi-armed Bandits"},{"key":"7","first-page":"655","article-title":"Pac subset selection in stochastic multi-armed bandits","author":"kalyanakrishnan","year":"2012","journal-title":"Proceedings of the 29th International Conference on Machine Learning (ICML-12)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_31"},{"key":"4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-45435-7_18","article-title":"Pac bounds for multi-armed bandit and markov decision processes","author":"even-dar","year":"2002","journal-title":"Computational Learning Theory"},{"key":"9","article-title":"Almost optimal exploration in multi-armed bandits","author":"karnin","year":"2013","journal-title":"Proceedings of the 10th International Conference on Machine Learning"},{"key":"8","author":"jamieson","year":"2013","journal-title":"On Finding the Largest Mean among Many"}],"event":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","location":"Princeton, NJ, USA","start":{"date-parts":[[2014,3,19]]},"end":{"date-parts":[[2014,3,21]]}},"container-title":["2014 48th Annual Conference on Information Sciences and Systems (CISS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6809375\/6814063\/06814096.pdf?arnumber=6814096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T09:22:01Z","timestamp":1498123321000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6814096\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ciss.2014.6814096","relation":{},"subject":[],"published":{"date-parts":[[2014,3]]}}}