{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:15:21Z","timestamp":1755796521375,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031340161"},{"type":"electronic","value":"9783031340178"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34017-8_6","type":"book-chapter","created":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T12:02:20Z","timestamp":1684843340000},"page":"59-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incentivizing Information Gain in\u00a0Hidden Information Multi-Action Games"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Lervold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6241-3084","authenticated-orcid":false,"given":"Gilbert L.","family":"Peterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4571-0319","authenticated-orcid":false,"given":"David W.","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Baier, H., Cowling, P.I.: Evolutionary MCTS for multi-action adversarial games. In: 2018 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2018)","DOI":"10.1109\/CIG.2018.8490403"},{"key":"6_CR2","unstructured":"Bethe, P.M.: The state of automated bridge play (2009). Unpublished"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"03","key":"6_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"GMJ Chaslot","year":"2008","unstructured":"Chaslot, G.M.J., Winands, M.H., Herik, H.J.V.D., Uiterwijk, J.W., Bouzy, B.: Progressive strategies for monte-carlo tree search. New Math. Nat. Comput. 4(03), 343\u2013357 (2008)","journal-title":"New Math. Nat. Comput."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TCIAIG.2012.2200894","volume":"4","author":"PI Cowling","year":"2012","unstructured":"Cowling, P.I., Powley, E.J., Whitehouse, D.: Information set monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 4(2), 120\u2013143 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"4","key":"6_CR6","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"},{"issue":"1\u20132","key":"6_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0004-3702(97)00082-9","volume":"100","author":"I Frank","year":"1998","unstructured":"Frank, I., Basin, D.: Search in games with incomplete information: a case study using bridge card play. Artif. Intell. 100(1\u20132), 87\u2013123 (1998)","journal-title":"Artif. Intell."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Fujiki, T., Ikeda, K., Viennot, S.: A platform for turn-based strategy games, with a comparison of monte-carlo algorithms. In: 2015 IEEE Conference on Computational Intelligence and Games (CIG), pp. 407\u2013414. IEEE (2015)","DOI":"10.1109\/CIG.2015.7317962"},{"key":"6_CR9","unstructured":"Keller, C.J., Averna, R., Matcheck, D.: How to master wargaming: commander and staff guide to improving course of action analysis 20\u201306. Mission Command Center of Excellence (2020)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Long, J.R., Sturtevant, N.R., Buro, M., Furtak, T.: Understanding the success of perfect information monte Carlo sampling in game tree search. In: Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7562"},{"key":"6_CR11","unstructured":"Russell, S., Wolfe, J.: Efficient belief-state and-or search, with application to kriegspiel. In: IJCAI, vol. 19, p. 278 (2005)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Sato, N., Fujiki, T., Ikeda, K.: Three types of forward pruning techniques to apply the alpha beta algorithm to turn-based strategy games. In: 2016 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2016)","DOI":"10.1109\/CIG.2016.7860427"},{"key":"6_CR13","unstructured":"Sato, N., Ikeda, K.: Phase division and simplification game offline tree search for phase evaluation value composition in turn-based strategy games. In: Game Programming Workshop, pp. 61\u201368 (2015)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34017-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T12:02:45Z","timestamp":1684843365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34017-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340161","9783031340178"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34017-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computers and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=3434","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"23","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":"15","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":"65% - 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":"2.5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}