Winning by Numbers: Connecting Strong Admissibility to Optimal Play in Argumentation
- 24 September 2025
- book chapter
- Published by Springer Nature
- p. 395-410
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computing remoteness functions of Moore, Wythoff, and Euclid’s gamesInternational Journal of Game Theory, 2024
- Combinatorial Game Theory2013
- On judgment aggregation in abstract argumentationAutonomous Agents and Multi-Agent Systems, 2009
- An argument game for stable semanticsLogic Journal of the IGPL, 2008
- A Game-Theoretic Measure of Argument Strength for Abstract Argumentation2008
- On principle-based evaluation of extension-based argumentation semanticsArtificial Intelligence, 2007
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Two-person games on graphsJournal of Combinatorial Theory, Series B, 1978
- Graphs and composite gamesJournal of Combinatorial Theory, 1966