{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:04:19Z","timestamp":1793124259507,"version":"4.5.0"},"reference-count":35,"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":"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":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation (NRF) Singapore and DSO National Laboratories through the AI Singapore Program","doi-asserted-by":"publisher","award":["AISG2-RP-2020-018"],"award-info":[{"award-number":["AISG2-RP-2020-018"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NRF Fellowship","award":["A-0005077-01-00"],"award-info":[{"award-number":["A-0005077-01-00"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tit.2022.3230939","type":"journal-article","created":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T18:56:02Z","timestamp":1671562562000},"page":"3240-3262","source":"Crossref","is-referenced-by-count":6,"title":["Best Arm Identification in Restless Markov Multi-Armed Bandits"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7798-1159","authenticated-orcid":false,"given":"P. N.","family":"Karthik","sequence":"first","affiliation":[{"name":"Institute of Data Science, National University of Singapore, Queenstown, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8051-0670","authenticated-orcid":false,"given":"Kota Srinivas","family":"Reddy","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-4527","authenticated-orcid":false,"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Mathematics and the Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"623","article-title":"The sample complexity of exploration in the multi-armed bandit problem","volume":"5","author":"mannor","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523607"},{"key":"ref15","first-page":"1238","article-title":"Almost optimal exploration in multi-armed bandits","author":"karnin","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref31","author":"thomas","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1022677271"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2198613"},{"key":"ref33","author":"chow","year":"2012","journal-title":"Probability Theory Independence Interchangeability Martingales"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1987.1104485"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-72206-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706205"},{"key":"ref1","first-page":"648","article-title":"Best restless Markov arm identification","author":"karthik","year":"2022","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref17","first-page":"41","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"Proc Conf Learn Theory"},{"key":"ref16","first-page":"423","article-title":"lil’UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref19","first-page":"228","article-title":"Information complexity in bandit subset selection","author":"kaufmann","year":"2013","journal-title":"Proc Conf Learn Theory"},{"key":"ref18","first-page":"655","article-title":"PAC subset selection in stochastic multi-armed bandits","volume":"12","author":"kalyanakrishnan","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2972875"},{"key":"ref23","first-page":"12772","article-title":"Probabilistic sequential shrinking: A best arm identification algorithm for stochastic bandits with corruptions","author":"zhong","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/07474946.2021.1912525"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2018.8645380"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3082028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591868"},{"key":"ref21","first-page":"11481","article-title":"Best arm identification for cascading bandits in the fixed confidence setting","author":"zhong","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8762-6_4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3159600"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref8","article-title":"Learning to detect an odd restless Markov arm with a trembling hand","author":"karthik","year":"2021","journal-title":"arXiv 2105 03603"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3075021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref4","first-page":"998","article-title":"Optimal best arm identification with fixed confidence","author":"garivier","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704973"},{"key":"ref6","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"kaufmann","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref5","first-page":"1","article-title":"Optimal best Markovian arm identification with fixed confidence","volume":"32","author":"moulos","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10106509\/09994751.pdf?arnumber=9994751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T18:21:09Z","timestamp":1684174869000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9994751\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":35,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3230939","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}