Assumption-Based Argumentation for the Minimal Concession Strategy

Several recent works in the area of Artificial Intelligence focus on computational models of argumentation-based negotiation. However, even if computational models of arguments are used to encompass the reasoning of interacting agents, this logical approach does not come with an effective strategy for agents engaged in negotiations. In this paper we propose a realisation of the Minimal Concession (MC) strategy which has been theoretically validated. The main contribution of this paper is the integration of this intelligent strategy in a practical application by means of assumption-based argumentation. We claim here that the outcome of negotiations, which are guaranteed to terminate, is an optimal agreement (when possible) if the agents adopt the MC strategy.