Applying Abstract Argumentation Theory to Cooperative Game Theory
This work provides incremental theoretical insights for researchers in computational argumentation and game theory by extending known correspondences.
The paper tackles the problem of mapping argumentation semantics to cooperative game theory solution concepts, showing correspondences between complete/grounded extensions and Roth's subsolutions/supercore, and proving that three-player convex games do not generally have well-founded argumentation frameworks.
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.