{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:14:13Z","timestamp":1758672853551,"version":"3.44.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032051332","type":"print"},{"value":"9783032051349","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05134-9_27","type":"book-chapter","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T11:17:48Z","timestamp":1758626268000},"page":"395-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Winning by\u00a0Numbers: Connecting Strong Admissibility to\u00a0Optimal Play in\u00a0Argumentation"],"prefix":"10.1007","author":[{"given":"Shawn","family":"Bowers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Caminada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertram","family":"Lud\u00e4scher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,24]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artif. Intell. 171(10\u201315), 675\u2013700 (2007). https:\/\/doi.org\/10.1016\/j.artint.2007.04.004","DOI":"10.1016\/j.artint.2007.04.004"},{"key":"27_CR2","unstructured":"Baumann, R., Linsbichler, T., Woltran, S.: Verifiability of argumentation semantics. In: COMMA, pp. 83\u201394 (2016). https:\/\/ebooks.iospress.nl\/volumearticle\/45249"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Boros, E., Gurvich, V., Makino, K., Vyalyi, M.: Computing remoteness functions of Moore, Wythoff, and Euclid\u2019s games. Int. J. Game Theory 53(4), 1315\u20131333 (2024). https:\/\/link.springer.com\/article\/10.1007\/s00182-024-00914-2","DOI":"10.1007\/s00182-024-00914-2"},{"key":"27_CR4","unstructured":"Bowers, S., Xia, Y., Lud\u00e4scher, B.: The skeptic\u2019s argumentation game or: well-founded explanations for mere mortals. In: SAFA 2024 (2024). https:\/\/ceur-ws.org\/Vol-3757\/paper8.pdf"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"Bowers, S., Xia, Y., Lud\u00e4scher, B.: On the structure of game provenance and its applications. In: Theory and Practice of Provenance (TaPP) at EuroS &PW (2024). https:\/\/doi.org\/10.48550\/arXiv.2410.05094","DOI":"10.48550\/arXiv.2410.05094"},{"key":"27_CR6","unstructured":"Caminada, M.: Argumentation semantics as formal discussion. In: Handbook of Formal Argumentation, vol.\u00a01, pp. 487\u2013518. College Publications (2018). https:\/\/orca.cardiff.ac.uk\/id\/eprint\/99969\/"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.3233\/AAC-190463","volume":"10","author":"M Caminada","year":"2019","unstructured":"Caminada, M., Dunne, P.: Strong admissibility revisited: theory and applications. Argum. Comput. 10, 277\u2013300 (2019). https:\/\/doi.org\/10.3233\/AAC-190463","journal-title":"Argum. Comput."},{"key":"27_CR8","unstructured":"Caminada, M., Dunne, P.: Minimal strong admissibility: a complexity analysis. In: COMMA, pp. 135\u2013146 (2020). https:\/\/ebooks.iospress.nl\/volumearticle\/55365"},{"key":"27_CR9","unstructured":"Caminada, M., Harikrishnan, S.: An evaluation of algorithms for strong admissibility. In: SAFA, pp. 69\u201382 (2024). https:\/\/ceur-ws.org\/Vol-3757\/paper5.pdf"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Caminada, M., Wu, Y.: An argument game for stable semantics. Logic J. IGPL 17(1), 77\u201390 (2009). https:\/\/doi.org\/10.1093\/jigpal\/jzn029","DOI":"10.1093\/jigpal\/jzn029"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.3233\/AAC-230012","volume":"16","author":"M Caminada","year":"2025","unstructured":"Caminada, M., Harikrishnan, S.: Tractable algorithms for strong admissibility. Argum. Comput. 16(2), 212\u2013236 (2025). https:\/\/doi.org\/10.3233\/AAC-230012","journal-title":"Argum. Comput."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Caminada, M., Pigozzi, G.: On judgment aggregation in abstract argumentation. Auton. Agents Multi-Agent Syst. 22(1), 64\u2013102 (2011). https:\/\/link.springer.com\/article\/10.1007\/s10458-009-9116-7","DOI":"10.1007\/s10458-009-9116-7"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"P Dung","year":"1995","unstructured":"Dung, P.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and $$n$$-person games. Artif. Intell. 77, 321\u2013357 (1995). https:\/\/doi.org\/10.1016\/0004-3702(94)00041-X","journal-title":"Artif. Intell."},{"key":"27_CR14","doi-asserted-by":"publisher","unstructured":"Fraenkel, A.S.: Combinatorial game theory foundations applied to digraph kernels. Electron. J. Comb. 4(2) (1997). https:\/\/doi.org\/10.37236\/1325","DOI":"10.37236\/1325"},{"issue":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"AV Gelder","year":"1991","unstructured":"Gelder, A.V., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991). https:\/\/doi.org\/10.1145\/116825.116838","journal-title":"J. ACM"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-87803-2_24","volume-title":"Logics in Artificial Intelligence","author":"P-A Matt","year":"2008","unstructured":"Matt, P.-A., Toni, F.: A game-theoretic measure of argument strength for abstract argumentation. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 285\u2013297. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87803-2_24"},{"key":"27_CR17","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press (1944)"},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1287\/moor.1.1.43","volume":"1","author":"AE Roth","year":"1976","unstructured":"Roth, A.E.: Subsolutions and the supercore of cooperative games. Math. Oper. Res. 1(1), 43\u201349 (1976). https:\/\/doi.org\/10.1287\/moor.1.1.43","journal-title":"Math. Oper. Res."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Roth, A.E.: Two-person games on graphs. J. Comb. Theory Ser. B 24(2), 238\u2013241 (1978). https:\/\/www.sciencedirect.com\/science\/article\/pii\/0095895678900266","DOI":"10.1016\/0095-8956(78)90026-6"},{"key":"27_CR20","doi-asserted-by":"publisher","unstructured":"Siegel, A.: Combinatorial Game Theory. Graduate Studies in Mathematics, vol.\u00a0146. American Mathematical Society (2013). https:\/\/doi.org\/10.1090\/gsm\/146","DOI":"10.1090\/gsm\/146"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0021-9800(66)80005-4","volume":"1","author":"CA Smith","year":"1966","unstructured":"Smith, C.A.: Graphs and composite games. J. Comb. Theory 1(1), 51\u201381 (1966). https:\/\/doi.org\/10.1016\/S0021-9800(66)80005-4","journal-title":"J. Comb. Theory"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05134-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T11:17:53Z","timestamp":1758626273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05134-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,24]]},"ISBN":["9783032051332","9783032051349"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05134-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,24]]},"assertion":[{"value":"24 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSQARU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Symbolic and Quantitative Approaches with Uncertainty","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagen","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","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":"ecsqaru2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecsqaru2025.krportal.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}