{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:50:55Z","timestamp":1768031455084,"version":"3.49.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000646","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["JP20K12124"],"award-info":[{"award-number":["JP20K12124"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,17]]},"DOI":"10.1109\/cog52621.2021.9619080","type":"proceedings-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T20:53:06Z","timestamp":1638910386000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Analyzing simplified Geister using DREAM"],"prefix":"10.1109","author":[{"given":"Lucien","family":"Troillet","sequence":"first","affiliation":[]},{"given":"Kiminori","family":"Matsuzaki","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"111","article-title":"Application of DREAM to the board game Geister","author":"chen","year":"2020","journal-title":"Proceedings of the Game Programming workshop (GPW 2020)"},{"key":"ref11","article-title":"DREAM: Deep Regret minimization with Advantage baselines and Model-free learning","volume":"2006","author":"steinberger","year":"2020","journal-title":"ArXiv"},{"key":"ref12","first-page":"1729","article-title":"Regret minimization in games with incomplete information","author":"bowling","year":"0","journal-title":"NIPS'07 Proceedings of the 20th International Conference on Neural Information Processing Systems"},{"key":"ref13","article-title":"An introduction to counterfactual regret minimization","author":"neller","year":"0","journal-title":"Proceedings of Model AI Assignments The Fourth Symposium on Educational Advances in Artificial Intelligence (EAAI-2013)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011829"},{"key":"ref15","first-page":"1078","article-title":"Monte Carlo Sampling for Regret Minimization in Extensive Games","volume":"22","author":"lanctot","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref16","article-title":"Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines","volume":"1809 3057","author":"schmid","year":"2018","journal-title":"ArXiv"},{"key":"ref17","article-title":"Low-variance and zero-variance baselines for extensive-form games","volume":"1907 9633","author":"davis","year":"2019","journal-title":"ArXiv"},{"key":"ref18","first-page":"793","article-title":"Deep counterfactual regret minimization","author":"brown","year":"0","journal-title":"Proceedings of the 36th International Conference on Machine Learning ICML 2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI48200.2019.8959878"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.1259433"},{"key":"ref3","author":"gibson","year":"2014","journal-title":"Regret Minimization in Games And The Development of Champion Multiplayer Computer Poker-playing Agents[D]"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103216"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1126\/science.aay2400","article-title":"Superhuman AI for multiplayer poker","volume":"365","author":"brown","year":"2019","journal-title":"Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IIAI-AAI.2019.00125"},{"key":"ref7","author":"vinyals","year":"2019","journal-title":"Alphastar Mastering the real-time strategy game StarCraft II"},{"key":"ref2","article-title":"Counterfactual Regret Minimization - the core of Poker AI beating professional players","year":"2018","journal-title":"int8"},{"key":"ref1","year":"0","journal-title":"Top | Geister Online"},{"key":"ref9","first-page":"137","article-title":"Counterfactual regret minimization for the board game Geister","author":"chen","year":"2018","journal-title":"Proceedings of the Game Programming Workshop (GPW 2018)"}],"event":{"name":"2021 IEEE Conference on Games (CoG)","location":"Copenhagen, Denmark","start":{"date-parts":[[2021,8,17]]},"end":{"date-parts":[[2021,8,20]]}},"container-title":["2021 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9618888\/9618891\/09619080.pdf?arnumber=9619080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:53:35Z","timestamp":1652201615000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9619080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/cog52621.2021.9619080","relation":{},"subject":[],"published":{"date-parts":[[2021,8,17]]}}}