Abstract
In this paper we describe an argumentation-based representation of normal form games, and demonstrate how argumentation can be used to compute pure strategy Nash equilibria. Our approach builds on Modgil's Extended Argumentation Frameworks. We demonstrate its correctness, prove several theoretical properties it satisfies, and outline how it can be used to explain why certain strategies are Nash equilibria to a non-expert human user.
Original language | English |
---|---|
Pages (from-to) | 195-208 |
Number of pages | 14 |
Journal | Argument and Computation |
Volume | 13 |
Issue number | 2 |
Early online date | 10 Jun 2021 |
DOIs | |
Publication status | Published - 1 Jun 2022 |
Keywords
- cs.AI
- cs.GT
- Argumentation
- Game theory
- Nash equilibrium
- Pure strategy