{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:44:11Z","timestamp":1730209451087,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,8,5]]},"DOI":"10.1109\/cog60054.2024.10645574","type":"proceedings-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T18:44:09Z","timestamp":1724870649000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Perfect Information Monte Carlo with Postponing Reasoning"],"prefix":"10.1109","author":[{"given":"J\u00e9r\u00f4me","family":"Arjonilla","sequence":"first","affiliation":[{"name":"Université Paris Dauphine – PSL,Paris,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdallah","family":"Saffidine","sequence":"additional","affiliation":[{"name":"Potassco Solutions,Potsdam,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[{"name":"Université Paris Dauphine – PSL,Paris,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.18893.74727"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aay2400"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633646"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CoG47356.2020.9231667"},{"key":"ref5","article-title":"Mastering Chess and Shogi by SelfPlay with a General Reinforcement Learning Algorithm","volume":"abs\/1712.01815","author":"Silver","year":"2017","journal-title":"ArXiv"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar6404"},{"key":"ref7","article-title":"An introduction to counterfactual regret minimization","volume-title":"Proceedings of model AI assignments, the fourth symposium on educational advances in artificial intelligence (EAAI2013)","volume":"11","author":"Neller"},{"key":"ref8","article-title":"Solving Heads-Up Limit Texas Hold\u2019em","author":"Tammelin","year":"2015","journal-title":"IJCAI"},{"key":"ref9","article-title":"Monte Carlo Sampling for Regret Minimization in Extensive Games","author":"Lanctot","year":"2009","journal-title":"NIPS"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7562"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-89453-5_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam6960"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/176"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/470"},{"key":"ref16","article-title":"Player of Games","volume":"abs\/2112.03178","author":"Schmid","year":"2021","journal-title":"ArXiv"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00082-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11844"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103645"},{"issue":"4","key":"ref20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CoG57401.2023.10333169"},{"key":"ref23","first-page":"1045","article-title":"Overconfidence or paranoia? search in imperfect-information games","volume-title":"PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE","volume":"21","author":"Parker"},{"volume":"2","article-title":"Paranoia versus overconfidence in imperfect information games","volume-title":"AAAI Proceedings of the 21st National Conference on Artificial intelligence","key":"ref24"},{"key":"ref25","article-title":"OpenSpiel: A Framework for Reinforcement Learning in Games","volume":"abs\/1908.09453","author":"Lanctot","year":"2019","journal-title":"ArXiv"},{"key":"ref26","article-title":"Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games","author":"Lis","year":"2015","journal-title":"AAMAS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8810"},{"key":"ref28","first-page":"23993","article-title":"Subgame solving without common knowledge","volume":"34","author":"Zhang","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2019.8848029"}],"event":{"name":"2024 IEEE Conference on Games (CoG)","start":{"date-parts":[[2024,8,5]]},"location":"Milan, Italy","end":{"date-parts":[[2024,8,8]]}},"container-title":["2024 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10645493\/10645533\/10645574.pdf?arnumber=10645574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T05:21:23Z","timestamp":1725081683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10645574\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,5]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/cog60054.2024.10645574","relation":{},"subject":[],"published":{"date-parts":[[2024,8,5]]}}}