Applying Abstract Argumentation Theory to Cooperative Game Theory

05/15/2019
by   Anthony P. Young, et al.
0

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.

READ FULL TEXT
research
12/20/2013

The DIAMOND System for Argumentation: Preliminary Report

Abstract dialectical frameworks (ADFs) are a powerful generalisation of ...
research
07/16/2014

A Plausibility Semantics for Abstract Argumentation Frameworks

We propose and investigate a simple ranking-measure-based extension sema...
research
07/19/2017

Argotario: Computational Argumentation Meets Serious Games

An important skill in critical thinking and argumentation is the ability...
research
11/04/2019

Compiling Arguments in an Argumentation Framework into Three-valued Logical Expressions

In this paper, we propose a new method for computing general allocators ...
research
09/12/2023

Games and Argumentation: Time for a Family Reunion!

The rule "defeated(X) ← attacks(Y,X), defeated(Y)" states that an argum...
research
03/12/2020

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

In this paper, we explore the issue of inconsistency handling over prior...
research
06/18/2018

Notes on Abstract Argumentation Theory

This note reviews Section 2 of Dung's seminal 1995 paper on abstract arg...

Please sign up or login with your details

Forgot password? Click here to reset