Abstract Games of Argumentation Strategy and Game-Theoretical Argument Strength
| Autor: | Antonio Rago, Francesca Toni, Pietro Baroni, Giulia Comini |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Value (ethics)
Scheme (programming language) 08 Information And Computing Sciences Computer Science::Computer Science and Game Theory Computer science business.industry Computer Science (all) 010102 general mathematics ComputingMilieux_PERSONALCOMPUTING Theoretical Computer Science 02 engineering and technology 01 natural sciences Argumentation theory Argument 0202 electrical engineering electronic engineering information engineering Artificial Intelligence & Image Processing 020201 artificial intelligence & image processing Artificial intelligence 0101 mathematics business Mathematical economics computer computer.programming_language |
| Zdroj: | PRIMA 2017: Principles and Practice of Multi-Agent Systems ISBN: 9783319691305 PRIMA |
| DOI: | 10.1007/978-3-319-69131-2_24 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|