Applying abstract argumentation theory to cooperative game theory

Research output: Contribution to journalConference articlepeer-review


We apply ideas from abstract argumentation theory to study cooperative game theory. Building on Dung's results in his seminal paper, we further the correspondence between Dung's four argumentation semantics and solution concepts in cooperative game theory by showing that complete extensions (the grounded extension) correspond to Roth's subsolutions (respectively, the supercore). We then investigate the relationship between well-founded argumentation frameworks and convex games, where in each case the semantics (respectively, solution concepts) coincide; we prove that three-player convex games do not in general have well-founded argumentation frameworks.

Original languageEnglish
Pages (from-to)105-119
Number of pages15
JournalCEUR Workshop Proceedings
Publication statusPublished - 1 Jan 2019
Event3rd Workshop on Advances In Argumentation In Artificial Intelligence, AI^3 2019 - Rende, Italy
Duration: 19 Nov 201922 Nov 2019


  • Abstract argumentation theory
  • Argumentation semantics
  • Convex games
  • Cooperative game theory
  • Solution concepts


Dive into the research topics of 'Applying abstract argumentation theory to cooperative game theory'. Together they form a unique fingerprint.

Cite this