Winning by numbers: connecting strong admissibility to optimal play in argumentation

Bowers, Shawn, Caminada, Martin ORCID: https://orcid.org/0000-0002-7498-0238 and Ludäscher, Bertram 2025. Winning by numbers: connecting strong admissibility to optimal play in argumentation. Presented at: The 18th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2025), Hagen, Germany, 23-26 September 2025. Published in: Sauerwald, Kai and Thimm, Matthias eds. Proceedings of the European Conference on Symbolic and Quantitative Approaches with Uncertainty. Lecture Notes in Computer Science , vol.16099 Springer Nature, pp. 395-410. 10.1007/978-3-032-05134-9_27

Preview

PDF - Accepted Post-Print Version Download (787kB) | Preview

Abstract

Strongly admissible labelings and min-max numberings offer well-founded explanations in formal argumentation. We establish a precise correspondence between min-max numberings and remoteness functions from combinatorial game theory, showing that min-max numbers characterize optimal play length, i.e., where players seek the fastest win or longest delay of loss. Our game–argumentation duality strengthens the theoretical and computational foundations for cross-fertilization between argumentation and game theory: game-theoretic provenance explanations apply to argumentation frameworks; pure strategy-based provenance aligns with strongly admissible labelings; and a linear-time algorithm for computing remoteness is sufficient to compute grounded labelings and min-max numbers.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Published Online
Status:	Published
Schools:	Schools > Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer Nature
ISBN:	9783032051332
Date of First Compliant Deposit:	25 July 2025
Date of Acceptance:	9 July 2025
Last Modified:	30 Oct 2025 14:45
URI:	https://orca.cardiff.ac.uk/id/eprint/180038

Actions (repository staff only)

Edit Item