{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:43Z","timestamp":1725740503709},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"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":[[2020,8]]},"DOI":"10.1109\/cog47356.2020.9231854","type":"proceedings-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T18:05:50Z","timestamp":1603303550000},"page":"89-95","source":"Crossref","is-referenced-by-count":1,"title":["Monte Carlo Tree Search Strategies in 2-Player Iterated Prisoner Dilemma Games"],"prefix":"10.1109","author":[{"given":"Garrison W.","family":"Greenwood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Ashlock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-4560-50-4_27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref10","first-page":"1","article-title":"Prisoner’s dilemma agents with phenotypic plasticity","author":"ashlock","year":"2019","journal-title":"2019 IEEE Conf Games"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2019.8848021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(94)90289-5"},{"key":"ref5","article-title":"A monte carlo approach for ghost avoidance in the Ms. pac man game","author":"tong","year":"2011","journal-title":"Proc IEEE Consum Electron Soc Games Innov Conf"},{"key":"ref8","first-page":"570","article-title":"MCTS based on simple regret","author":"tolpin","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/002200278002400301"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2200\/S00940ED1V01Y201907GCI004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/002200278002400101"}],"event":{"name":"2020 IEEE Conference on Games (CoG)","start":{"date-parts":[[2020,8,24]]},"location":"Osaka, Japan","end":{"date-parts":[[2020,8,27]]}},"container-title":["2020 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9222389\/9231525\/09231854.pdf?arnumber=9231854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:43:12Z","timestamp":1656344592000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9231854\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/cog47356.2020.9231854","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}