{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T02:17:54Z","timestamp":1783649874070,"version":"3.55.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319149226","type":"print"},{"value":"9783319149233","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14923-3_1","type":"book-chapter","created":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T14:04:52Z","timestamp":1418479492000},"page":"1-15","source":"Crossref","is-referenced-by-count":9,"title":["Minimizing\u00a0Simple\u00a0and\u00a0Cumulative\u00a0Regret in\u00a0Monte-Carlo\u00a0Tree\u00a0Search"],"prefix":"10.1007","author":[{"given":"Tom","family":"Pepels","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Lanctot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCIAIG.2010.2067212","volume":"2","author":"B. Arneson","year":"2010","unstructured":"Arneson, B., Hayward, R., Henderson, P.: Monte-Carlo tree search in Hex. IEEE Trans. Comput. Intell. AI in Games\u00a02(4), 251\u2013258 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI in Games"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Audibert, J., Bubeck, S., Munos, R.: Best arm identification in multi-armed bandits. In: Proc. 23rd Conf. on Learn. Theory, pp. 41\u201353 (2010)","DOI":"10.1007\/978-3-642-04414-4_7"},{"issue":"2-3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"1_CR4","unstructured":"Balla, R.K., Fern, A.: UCT for tactical assault planning in real-time strategy games. In: Boutilier, C. (ed.) Proc. of the 21st Int. Joint Conf. on Artif. Intel. (IJCAI), pp. 40\u201345 (2009)"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C. Browne","year":"2012","unstructured":"Browne, C., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte-Carlo tree search methods. IEEE Trans. on Comput. Intell. AI in Games\u00a04(1), 1\u201343 (2012)","journal-title":"IEEE Trans. on Comput. Intell. AI in Games"},{"issue":"19","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.tcs.2010.12.059","volume":"412","author":"S. Bubeck","year":"2010","unstructured":"Bubeck, S., Munos, R., Stoltz, G.: Pure exploration in finitely-armed and continuous-armed bandits. Theoretical Comput. Sci.\u00a0412(19), 1832\u20131852 (2010)","journal-title":"Theoretical Comput. Sci."},{"key":"1_CR7","volume-title":"Sequential halving applied to trees","author":"T. Cazenave","year":"2014","unstructured":"Cazenave, T.: Sequential halving applied to trees. IEEE Computer Society Press, Los Alamitos (2014)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in monte-carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"1_CR9","unstructured":"Feldman, Z., Domshlak, C.: Simple regret optimization in online planning for markov decision processes. CoRR abs\/1206.3382 (2012)"},{"key":"1_CR10","unstructured":"Karnin, Z., Koren, T., Somekh, O.: Almost optimal exploration in multi-armed bandits. In: Proc. of the Int. Conf. on Mach. Learn., pp. 1238\u20131246 (2013)"},{"key":"1_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"1_CR12","unstructured":"Pepels, T.: Novel Selection Methods for Monte-Carlo Tree Search. Master\u2019s thesis, Department of Knowledge Engineering, Maastricht University, Maastricht, The Netherlands (2014)"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TCIAIG.2013.2291577","volume":"6","author":"T. Pepels","year":"2014","unstructured":"Pepels, T., Winands, M.H.M., Lanctot, M.: Real-time Monte Carlo Tree Search in Ms Pac-Man. IEEE Trans. Comp. Intell. AI Games\u00a06(3), 245\u2013257 (2014)","journal-title":"IEEE Trans. Comp. Intell. AI Games"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Powley, E.J., Whitehouse, D., Cowling, P.I.: Monte Carlo tree search with macro-actions and heuristic route planning for the physical travelling salesman problem. In: IEEE Conf. Comput. Intell. Games, pp. 234\u2013241. IEEE (2012)","DOI":"10.1109\/CIG.2012.6374161"},{"key":"1_CR15","unstructured":"Ramanujan, R., Sabharwal, A., Selman, B.: Understanding Sampling Style Adversarial Search Methods. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence, pp. 474\u2013483 (2010)"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1109\/TCIAIG.2010.2098876","volume":"2","author":"A. Rimmel","year":"2010","unstructured":"Rimmel, A., Teytaud, O., Lee, C., Yen, S., Wang, M., Tsai, S.: Current frontiers in computer Go. IEEE Trans. Comput. Intell. AI in Games\u00a02(4), 229\u2013238 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI in Games"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Teytaud, F., Teytaud, O.: On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms. In: IEEE Conference on Computational Intelligence and Games, pp. 359\u2013364. IEEE (2010)","DOI":"10.1109\/ITW.2010.5593334"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Tolpin, D., Shimony, S.: MCTS based on simple regret. In: Proc. Assoc. Adv. Artif. Intell., pp. 570\u2013576 (2012)","DOI":"10.1609\/aaai.v26i1.8126"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87608-3_3","volume-title":"Computers and Games","author":"M.H.M. Winands","year":"2008","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.-T.: Monte-Carlo Tree Search Solver. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 25\u201336. Springer, Heidelberg (2008)"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TCIAIG.2010.2061050","volume":"2","author":"M.H.M. Winands","year":"2010","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.T.: Monte Carlo Tree Search in Lines of Action. IEEE Trans. Comp. Intell. AI Games\u00a02(4), 239\u2013250 (2010)","journal-title":"IEEE Trans. Comp. Intell. AI Games"}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14923-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T17:30:40Z","timestamp":1690738240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14923-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319149226","9783319149233"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14923-3_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}