Abstract Games of Argumentation Strategy and Game-Theoretical Argument Strength
File(s)GT.pdf (396.75 KB)
Accepted version
Author(s)
Baroni, P
Comini, G
Rago, A
Toni, F
Type
Conference Paper
Abstract
We define a generic notion of abstract games of argumentation strategy for (attack-only and bipolar) argumentation frameworks, which are zero-sum games whereby two players put forward sets of arguments and get a reward for their combined choices. The value of these games, in the classical game-theoretic sense, can be used to define measures of (quantitative) game-theoretic strength of arguments, which are different depending on whether either or both players have an “agenda” (i.e. an argument they want to be accepted). We show that this general scheme captures as a special instance a previous proposal in the literature (single agenda, attack-only frameworks), and seamlessly supports the definition of a spectrum of novel measures of game-theoretic strength where both players have an agenda and/or bipolar frameworks are considered. We then discuss the applicability of these instances of game-theoretic strength in different contexts and analyse their basic properties.
Date Issued
2017-10-30
Date Acceptance
2017-08-31
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10621, pp.403-419
ISBN
9783319691305
ISSN
0302-9743
Publisher
Springer
Start Page
403
End Page
419
Journal / Book Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
10621
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-69131-2_24
Source
PRIMA
Subjects
08 Information And Computing Sciences
Artificial Intelligence & Image Processing
Publication Status
Published