{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:45:47Z","timestamp":1771479947855,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1434419"],"award-info":[{"award-number":["CMMI-1434419"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1923145"],"award-info":[{"award-number":["DMS-1923145"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95502010211"],"award-info":[{"award-number":["FA95502010211"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0383"],"award-info":[{"award-number":["FA9550-19-1-0383"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N660011824024"],"award-info":[{"award-number":["N660011824024"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UChicago Argonne LLC","award":["1F-60250"],"award-info":[{"award-number":["1F-60250"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1109\/tac.2021.3088792","type":"journal-article","created":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T19:48:35Z","timestamp":1623700115000},"page":"2685-2699","source":"Crossref","is-referenced-by-count":22,"title":["An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2716-6214","authenticated-orcid":false,"given":"Yunchuan","family":"Li","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2105-4932","authenticated-orcid":false,"given":"Michael C.","family":"Fu","sequence":"additional","affiliation":[{"name":"R. H. Smith School of Business and the Institute for Systems Research, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9422-6080","authenticated-orcid":false,"given":"Jie","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Systems Engineering and Operations Research, George Mason University, Fairfax, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.884993"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797188"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref30","volume":"82","author":"degroot","year":"2005","journal-title":"Optimal Statistical Decisions"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1494"},{"key":"ref35","article-title":"Monte Carlo tree search with optimal computing budget allocation","author":"li","year":"2021"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1939"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.26481\/dis.20110525ms","article-title":"Selective search in games of different complexity","author":"schadd","year":"2011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E97.D.392"},{"key":"ref12","first-page":"4897","article-title":"Monte-Carlo tree search by best arm identification","author":"kaufmann","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","first-page":"4680","article-title":"Blazing the trails before beating the path: sample-efficient Monte-Carlo planning","author":"grill","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref15","first-page":"828","article-title":"Best-arm identification in linear bandits","author":"soare","year":"0","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref16","first-page":"4877","article-title":"Best arm identification in linear bandits with linear dimension dependency","volume":"80","author":"tao","year":"0","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref17","first-page":"1655","article-title":"X-armed bandits","volume":"12","author":"bubeck","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986276"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008349927281"},{"key":"ref28","first-page":"379","article-title":"Combinatorial pure exploration of multi-armed bandits","volume":"27","author":"chen","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref27","first-page":"3592","article-title":"On interruptible pure exploration in multi-armed bandits","author":"shleyfman","year":"0","journal-title":"Proc 29th AAAI Conf Artific Intell"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0145"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4425000"},{"key":"ref2","author":"bertsekas","year":"1995","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref9","article-title":"Bandit algorithms for tree search","author":"coquelin","year":"2007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9030099"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/7437"},{"key":"ref22","first-page":"594","article-title":"Optimal computing budget allocation for multi-objective simulation models","volume":"1","author":"lee","year":"0","journal-title":"Proc Winter Simul Conf"},{"key":"ref21","first-page":"2598","article-title":"An effective approach to smartly allocate computing budget for discrete event simulation","volume":"3","author":"chen","year":"0","journal-title":"Proc 34th IEEE Conf Decis Control"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/24725854.2019.1659524"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2423832"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSM.2017.2693259"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2015.2464709"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9782883\/9454361-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9782883\/09454361.pdf?arnumber=9454361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T20:19:45Z","timestamp":1655756385000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9454361\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":36,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tac.2021.3088792","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}