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.
Various structured argumentation frameworks utilize preferences as part of their standard inference procedure to enable reasoning with preferences.
The task of recognizing goals and plans from missing and full observations can be done efficiently by using automated planning techniques.
Assessing whether an agent has abandoned a goal or is actively pursuing it is important when multiple agents are trying to achieve joint goals, or when agents commit to achieving goals for each other.
In this paper we investigate the links between instantiated argumentation systems and the axioms for non-monotonic reasoning described in  with the aim of characterising the nature of argument based reasoning.
Computational trust mechanisms aim to produce trust ratings from both direct and indirect information about agents' behaviour.
In this paper we describe a decision process framework allowing an agent to decide what information it should reveal to its neighbours within a communication graph in order to maximise its utility.