Applying Abstract Argumentation Theory to Cooperative Game Theory
Young, Anthony P., Marzagao, David Kohan, Murphy, Josh
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
May-15-2019
- Country:
- Europe > United Kingdom
- England > Oxfordshire > Oxford (0.04)
- North America > United States
- California > Los Angeles County
- Santa Monica (0.04)
- New York (0.04)
- California > Los Angeles County
- Europe > United Kingdom
- Genre:
- Research Report (0.64)
- Industry:
- Leisure & Entertainment > Games (1.00)
- Technology: