{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:41:57Z","timestamp":1730209317898,"version":"3.28.0"},"reference-count":23,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,17]]},"DOI":"10.1109\/cog52621.2021.9619088","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":0,"title":["Optimizing \u03b1\u00b5"],"prefix":"10.1109","author":[{"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[]},{"given":"Swann","family":"Legras","sequence":"additional","affiliation":[]},{"given":"Veronique","family":"Ventos","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/66"},{"key":"ref11","article-title":"Openspiel: A framework for reinforcement learning in games","author":"lanctot","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633646"},{"key":"ref13","first-page":"456","article-title":"Nested monte-carlo search","author":"cazenave","year":"2009","journal-title":"IJCAI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CoG47356.2020.9231667"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00083-9"},{"key":"ref16","article-title":"The ?µ search algorithm for the game of bridge","author":"cazenave","year":"2020","journal-title":"Monte Carlo Search at IJCAI"},{"key":"ref17","article-title":"Representing and reducing uncertainty for enumerating the belief space to improve endgame play in skat","author":"edelkamp","year":"2020","journal-title":"ECAI 2020"},{"journal-title":"Bridge for Beginners A Complete Course","year":"2014","author":"mahmood","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00193"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_12"},{"key":"ref3","article-title":"Improving state evaluation, inference, and search in trick-based card games","author":"buro","year":"0","journal-title":"Twenty-First International Joint Conference on Artificial Intelligence"},{"key":"ref6","article-title":"Understanding the success of perfect information monte carlo sampling in game tree search","author":"long","year":"0","journal-title":"Twenty-Fourth AAAI Conference on Artificial Intelligence"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75538-8_11"},{"key":"ref8","first-page":"1729","article-title":"Regret minimization in games with incomplete information","author":"zinkevich","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.820"},{"key":"ref9","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":"ref1","first-page":"95","article-title":"The million pound bridge program","author":"levy","year":"1989","journal-title":"Heuristic Programming in Artificial Intelligence The First Computer Olympiad"},{"journal-title":"Search algorithms for a bridge double dummy solver","year":"2010","author":"haglund","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_6"},{"key":"ref21","first-page":"93","article-title":"On the parallelization of UCT","author":"cazenave","year":"0","journal-title":"Proceedings of the Computer Games Workshop"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_7"}],"event":{"name":"2021 IEEE Conference on Games (CoG)","start":{"date-parts":[[2021,8,17]]},"location":"Copenhagen, Denmark","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\/09619088.pdf?arnumber=9619088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:53:33Z","timestamp":1652201613000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9619088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/cog52621.2021.9619088","relation":{},"subject":[],"published":{"date-parts":[[2021,8,17]]}}}