{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:06:13Z","timestamp":1743062773247,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031226946"},{"type":"electronic","value":"9783031226953"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22695-3_11","type":"book-chapter","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T15:11:58Z","timestamp":1669993918000},"page":"145-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Feasibility of Deep Counterfactual Regret Minimisation for Trading Card Games"],"prefix":"10.1007","author":[{"given":"David","family":"Adams","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,3]]},"reference":[{"key":"11_CR1","unstructured":"Dueling book. https:\/\/www.duelingbook.com\/"},{"key":"11_CR2","unstructured":"Project ignis card scripts for edopro. https:\/\/github.com\/ProjectIgnis\/CardScripts"},{"key":"11_CR3","unstructured":"Project ignis: Edopro. https:\/\/github.com\/ProjectIgnis\/EDOPro"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Best-first minimax search: Artif. Intell. 84(1), 299\u2013337 (1996). https:\/\/doi.org\/10.1016\/0004-3702(95)00096-8","DOI":"10.1016\/0004-3702(95)00096-8"},{"key":"11_CR5","unstructured":"Akira: Yu-gi-oh! world championship 2013. https:\/\/roadoftheking.com\/yu-gi-oh-world-championship-2013\/"},{"issue":"6218","key":"11_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1126\/science.1259433","volume":"347","author":"M Bowling","year":"2015","unstructured":"Bowling, M., Burch, N., Johanson, M., Tammelin, O.: Heads-up limit Hold\u2019em poker is solved. Science 347(6218), 145\u2013149 (2015)","journal-title":"Science"},{"key":"11_CR7","unstructured":"Brown, N., Ganzfried, S., Sandholm, T.: Hierarchical abstraction, distributed equilibrium computation, and post-processing, with application to a champion no-limit Texas Hold\u2019em agent. In: Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)"},{"key":"11_CR8","unstructured":"Brown, N., Lerer, A., Gross, S., Sandholm, T.: Deep counterfactual regret minimization. CoRR abs\/1811.00164 (2018). http:\/\/arxiv.org\/abs\/1811.00164"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Brown, N., Sandholm, T.: Superhuman AI for heads-up no-limit poker: libratus beats top professionals. Science 359(6374), 418\u2013424 (2018). https:\/\/doi.org\/10.1126\/science.aao1733, https:\/\/science.sciencemag.org\/content\/359\/6374\/418","DOI":"10.1126\/science.aao1733"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Browne, C., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (03 2012). https:\/\/doi.org\/10.1109\/TCIAIG.2012.2186810","DOI":"10.1109\/TCIAIG.2012.2186810"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TCIAIG.2012.2204883","volume":"4","author":"PI Cowling","year":"2012","unstructured":"Cowling, P.I., Ward, C.D., Powley, E.J.: Ensemble determinization in Monte Carlo tree search for the imperfect information card game magic: the gathering. IEEE Trans. Comput. Intell. AI Games 4(4), 241\u2013257 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"11_CR12","unstructured":"Dockhorn, A., Mostaghim, S.: Introducing the hearthstone-AI competition. arXiv preprint arXiv:1906.04238 (2019)"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Grad, \u0141.: Helping AI to play hearthstone using neural networks. In: 2017 Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 131\u2013134 (2017). https:\/\/doi.org\/10.15439\/2017F561","DOI":"10.15439\/2017F561"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"James, S., Konidaris, G., Rosman, B.: An analysis of Monte Carlo tree search. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 31 (2017)","DOI":"10.1609\/aaai.v31i1.11028"},{"key":"11_CR15","unstructured":"Blar, J., Mutchler, D., Liu, C.: Games with imperfect information (1993)"},{"key":"11_CR16","unstructured":"Johanson, M., Bard, N., Lanctot, M., Gibson, R.G., Bowling, M.: Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization. In: AAMAS, pp. 837\u2013846. Citeseer (2012)"},{"key":"11_CR17","unstructured":"Konami: Yugioh duel links. https:\/\/www.konami.com\/yugioh\/duel_links\/en\/"},{"key":"11_CR18","unstructured":"Li, H., Hu, K., Zhang, S., Qi, Y., Song, L.: Double neural counterfactual regret minimization. In: International Conference on Learning Representations (2020). https:\/\/openreview.net\/forum?id=ByedzkrKvH"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Matros, A.: Lloyd shapley and chess with imperfect information. Games Econ. Behav. 108, 600\u2013613 (2018). https:\/\/doi.org\/10.1016\/j.geb.2017.12.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0899825617302221, special Issue in Honor of Lloyd Shapley: Seven Topics in Game Theory","DOI":"10.1016\/j.geb.2017.12.003"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Schmid, M., Burch, N., Lanctot, M., Moravcik, M., Kadlec, R., Bowling, M.: Variance reduction in Monte Carlo counterfactual regret minimization (VR-MCCFR) for extensive form games using baselines. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2157\u20132164 (2019)","DOI":"10.1609\/aaai.v33i01.33012157"},{"key":"11_CR21","unstructured":"Silver, D., et al.: Mastering chess and shogi by self-play with a general reinforcement learning algorithm (2017)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Silver, D., et al.: Mastering the game of go without human knowledge. Nature 550(7676), 354\u2013359 (2017)","DOI":"10.1038\/nature24270"},{"key":"11_CR23","unstructured":"SinL0rtuen: New format\u2019s top tiers - let\u2019s make a list together ii. https:\/\/www.pojo.biz\/board\/showthread.php?t=991471"},{"key":"11_CR24","unstructured":"Syrgkanis, V., Agarwal, A., Luo, H., Schapire, R.E.: Fast convergence of regularized learning in games. arXiv preprint arXiv:1507.00407 (2015)"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Ward, C.D., Cowling, P.I.: Monte Carlo search applied to card selection in magic: the gathering. In: 2009 IEEE Symposium on Computational Intelligence and Games, pp. 9\u201316 (2009). https:\/\/doi.org\/10.1109\/CIG.2009.5286501","DOI":"10.1109\/CIG.2009.5286501"},{"key":"11_CR26","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems, vol. 20, pp. 1729\u20131736 (2007)"}],"container-title":["Lecture Notes in Computer Science","AI 2022: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22695-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:22:50Z","timestamp":1710256970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22695-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031226946","9783031226953"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22695-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}