{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:24:25Z","timestamp":1759940665210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054278"},{"type":"electronic","value":"9783319054285"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05428-5_3","type":"book-chapter","created":{"date-parts":[[2014,3,31]],"date-time":"2014-03-31T10:56:18Z","timestamp":1396263378000},"page":"28-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel"],"prefix":"10.1007","author":[{"given":"Marc","family":"Lanctot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viliam","family":"Lis\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,1]]},"reference":[{"unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 322\u2013331 (1995)","key":"3_CR1"},{"key":"3_CR2","series-title":"LNCS","first-page":"53","volume-title":"EvoApplications 2011, Part I","author":"D Auger","year":"2011","unstructured":"Auger, D.: Multiple tree for partially observable Monte-Carlo tree search. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 53\u201362. Springer, Heidelberg (2011)"},{"unstructured":"Bosansky, B., Lisy, V., Cermak, J., Vitek, R., Pechoucek, M.: Using double-oracle method and serialized alpha-beta search for pruning in simultaneous moves games. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI), pp. 48\u201354 (2013)","key":"3_CR3"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., 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. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"3_CR5","series-title":"IFIP","first-page":"361","volume-title":"Advances in Computer Games","author":"M Buro","year":"2003","unstructured":"Buro, M.: Solving the Oshi-Zumo game. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games. IFIP, vol. 135, pp. 361\u2013366. Springer, Heidelberg (2003)"},{"key":"3_CR6","series-title":"LNCS","first-page":"93","volume-title":"CG 2010","author":"T Cazenave","year":"2011","unstructured":"Cazenave, T., Saffidine, A.: Score bounded Monte-Carlo tree search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 93\u2013104. Springer, Heidelberg (2011)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"GMJB Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. New Math. Nat. Comput. 4(3), 343\u2013357 (2008)","journal-title":"New Math. Nat. Comput."},{"key":"3_CR8","series-title":"LNCS","first-page":"433","volume-title":"LION 2011","author":"A Couetoux","year":"2011","unstructured":"Couetoux, A., Hoock, J.-B., Sokolovska, N., Teytaud, O., Bonnard, N.: Continuous upper confidence trees. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 433\u2013445. Springer, Heidelberg (2011)"},{"key":"3_CR9","series-title":"LNCS","first-page":"72","volume-title":"CG 2006","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.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TCIAIG.2012.2200894","volume":"4","author":"PI Cowling","year":"2012","unstructured":"Cowling, P.I., Powley, E.J., Whitehouse, D.: Information set Monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 4(2), 120\u2013143 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"unstructured":"Finnsson, H.: Cadia-player: a general game playing agent. Master\u2019s thesis, Reykjav\u00edk University (2007)","key":"3_CR11"},{"unstructured":"Finnsson, H.: Simulation-based general game playing. Ph.D. thesis, Reykjav\u00edk University (2012)","key":"3_CR12"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/2093548.2093574","volume":"55","author":"S Gelly","year":"2012","unstructured":"Gelly, S., Kocsis, L., Schoenauer, M., Sebag, M., Silver, D., Szepesv\u00e1ri, C., Teytaud, O.: The grand challenge of computer go: Monte Carlo tree search and extensions. Commun. ACM 55(3), 106\u2013113 (2012)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Gibson, R., Lanctot, M., Burch, N., Szafron, D., Bowling, M.: Generalized sampling and variance in counterfactual regret minimization. In: Proceedings of the Twenty-Sixth Conference on Artificial Intelligence (AAAI-12), pp. 1355\u20131361 (2012)","key":"3_CR14","DOI":"10.1609\/aaai.v26i1.8241"},{"issue":"5","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S Hart","year":"2000","unstructured":"Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometrica 68(5), 1127\u20131150 (2000)","journal-title":"Econometrica"},{"key":"3_CR16","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"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. 4212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"unstructured":"Lanctot, M., Waugh, K., Bowling, M., Zinkevich, M.: Sampling for regret minimization in extensive games. In: Advances in Neural Information Processing Systems (NIPS 2009), pp. 1078\u20131086 (2009)","key":"3_CR17"},{"unstructured":"Lanctot, M.: Monte Carlo sampling and regret minimization for equilibrium computation and decision-making in large extensive form games. Ph.D. thesis, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada (2013)","key":"3_CR18"},{"doi-asserted-by":"crossref","unstructured":"Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In. Proceedings of the Eleventh International Conference on Machine Learning, pp. 157\u2013163. Morgan Kaufmann (1994)","key":"3_CR19","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"doi-asserted-by":"crossref","unstructured":"Perick, P., St-Pierre, D.L., Maes, F., Ernst, D.: Comparison of different selection strategies in Monte-Carlo tree search for the game of Tron. In: Proceedings of the IEEE Conference on Computational Intelligence and Games (CIG), pp. 242\u2013249 (2012)","key":"3_CR20","DOI":"10.1109\/CIG.2012.6374162"},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"150","DOI":"10.3390\/g3040150","volume":"3","author":"GC Rhoads","year":"2012","unstructured":"Rhoads, G.C., Bartholdi, L.: Computer solution to the game of pure strategy. Games 3(4), 150\u2013156 (2012)","journal-title":"Games"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"621","DOI":"10.2307\/3212187","volume":"8","author":"SM Ross","year":"1971","unstructured":"Ross, S.M.: Goofspiel \u2013 the game of pure strategy. J. Appl. Probab. 8(3), 621\u2013625 (1971)","journal-title":"J. Appl. Probab."},{"doi-asserted-by":"crossref","unstructured":"Saffidine, A., Finnsson, H., Buro, M.: Alpha-beta pruning for games with simultaneous moves. In: Proceedings of the Thirty-Second Conference on Artificial Intelligence (AAAI-12), pp. 556\u2013562 (2012)","key":"3_CR23","DOI":"10.1609\/aaai.v26i1.8148"},{"doi-asserted-by":"crossref","unstructured":"Samothrakis, S., Robles, D., Lucas, S.M.: A UCT agent for Tron: initial investigations. In: Proceedings of the 2010 IEEE Symposium on Computational Intelligence and Games (CIG), pp. 365\u2013371 (2010)","key":"3_CR24","DOI":"10.1109\/ITW.2010.5593331"},{"unstructured":"Shafiei, M., Sturtevant, N.R., Schaeffer, J.: Comparing UCT versus CFR in simultaneous games. In: Proceeding of the IJCAI Workshop on General Game-Playing (GIGA), pp. 75\u201382 (2009)","key":"3_CR25"},{"key":"3_CR26","series-title":"LNCS","first-page":"153","volume-title":"EvoApplications 2011, Part I","author":"O Teytaud","year":"2011","unstructured":"Teytaud, O., Flory, S.: Upper confidence trees with short term partial information. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 153\u2013162. Springer, Heidelberg (2011)"},{"key":"3_CR27","series-title":"LNCS","first-page":"25","volume-title":"CG 2008","author":"MHM 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. 5131, pp. 25\u201336. Springer, Heidelberg (2008)"},{"unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems 20 (NIPS 2007), pp. 905\u2013912 (2008)","key":"3_CR28"}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05428-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:42:48Z","timestamp":1676853768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05428-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319054278","9783319054285"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05428-5_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 April 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}