{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:56:38Z","timestamp":1743054998029,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031549670"},{"type":"electronic","value":"9783031549687"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54968-7_8","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T04:12:27Z","timestamp":1708920747000},"page":"88-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantifying Feature Importance of\u00a0Games and\u00a0Strategies via\u00a0Shapley Values"],"prefix":"10.1007","author":[{"given":"Satoru","family":"Fujii","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"8_CR1","unstructured":"Beechey, D., Smith, T.M., \u015eim\u015fek, \u00d6.: Explaining reinforcement learning with Shapley values. In: International Conference on Machine Learning, pp. 2003\u20132014. PMLR (2023)"},{"key":"8_CR2","unstructured":"Brown, N., Lerer, A., Gross, S., Sandholm, T.: Deep counterfactual regret minimization. In: International Conference on Machine Learning, pp. 793\u2013802. PMLR (2019)"},{"key":"8_CR3","first-page":"17212","volume":"33","author":"I Covert","year":"2020","unstructured":"Covert, I., Lundberg, S.M., Lee, S.I.: Understanding global feature contributions with additive importance measures. Adv. Neural. Inf. Process. Syst. 33, 17212\u201317223 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"8_CR4","unstructured":"Greydanus, S., Koul, A., Dodge, J., Fern, A.: Visualizing and understanding Atari agents. In: International Conference on Machine Learning, pp. 1792\u20131801. PMLR (2018)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Han, S., Wang, H., Su, S., Shi, Y., Miao, F.: Stable and efficient Shapley value-based reward reallocation for multi-agent reinforcement learning of autonomous vehicles. In: 2022 International Conference on Robotics and Automation (ICRA), pp. 8765\u20138771. IEEE (2022)","DOI":"10.1109\/ICRA46639.2022.9811626"},{"key":"8_CR6","unstructured":"Heinrich, J., Silver, D.: Deep reinforcement learning from self-play in imperfect-information games. arXiv preprint arXiv:1603.01121 (2016)"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106685","volume":"214","author":"A Heuillet","year":"2021","unstructured":"Heuillet, A., Couthouis, F., D\u00edaz-Rodr\u00edguez, N.: Explainability in deep reinforcement learning. Knowl.-Based Syst. 214, 106685 (2021)","journal-title":"Knowl.-Based Syst."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Johanson, M., Bard, N., Burch, N., Bowling, M.: Finding optimal abstract strategies in extensive-form games. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a026 (2012)","DOI":"10.1609\/aaai.v26i1.8269"},{"key":"8_CR9","unstructured":"Lanctot, M., et al.: OpenSpiel: a framework for reinforcement learning in games. CoRR abs\/1908.09453 (2019). http:\/\/arxiv.org\/abs\/1908.09453"},{"key":"8_CR10","first-page":"1078","volume":"22","author":"M Lanctot","year":"2009","unstructured":"Lanctot, M., Waugh, K., Zinkevich, M., Bowling, M.: Monte Carlo sampling for regret minimization in extensive games. Adv. Neural. Inf. Process. Syst. 22, 1078\u20131086 (2009)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Li, J., Kuang, K., Wang, B., Liu, F., Chen, L., Wu, F., Xiao, J.: Shapley counterfactual credits for multi-agent reinforcement learning. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 934\u2013942 (2021)","DOI":"10.1145\/3447548.3467420"},{"key":"8_CR12","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"8_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, USA (2007)"},{"issue":"6419","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D., et al.: A general reinforcement learning algorithm that masters chess, shogi, and go through self-play. Science 362(6419), 1140\u20131144 (2018)","journal-title":"Science"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10115-013-0679-x","volume":"41","author":"E \u0160trumbelj","year":"2014","unstructured":"\u0160trumbelj, E., Kononenko, I.: Explaining prediction models and individual predictions with feature contributions. Knowl. Inf. Syst. 41(3), 647\u2013665 (2014)","journal-title":"Knowl. Inf. Syst."},{"key":"8_CR16","unstructured":"Waugh, K., Schnizlein, D., Bowling, M.H., Szafron, D.: Abstraction pathologies in extensive games. In: AAMAS (2), pp. 781\u2013788 (2009)"},{"key":"8_CR17","first-page":"1729","volume":"20","author":"M Zinkevich","year":"2007","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. Adv. Neural. Inf. Process. Syst. 20, 1729\u20131736 (2007)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54968-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T04:12:54Z","timestamp":1708920774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54968-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031549670","9783031549687"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54968-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Advances in Computer Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siegen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=3788","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":"29","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":"14","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":"48% - 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)"}}]}}