Skip to Main content Skip to Navigation

Optimization of Probabilistic Argumentation With Markov Decision Models

Abstract : One prominent way to deal with conflicting viewpoints among agents is to conduct an argumentative debate: by exchanging arguments, agents can seek to persuade each other. In this paper we investigate the problem, for an agent, of optimizing a sequence of moves to be put forward in a debate, against an opponent assumed to behave stochasti-cally, and equipped with an unknown initial belief state. Despite the prohibitive number of states induced by a naive mapping to Markov models, we show that exploiting several features of such interaction settings allows for optimal resolution in practice, in particular: (1) as debates take place in a public space (or common ground), they can readily be modelled as Mixed Observability Markov Decision Processes, (2) as argumentation problems are highly structured, one can design optimization techniques to prune the initial instance. We report on the experimental evaluation of these techniques.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Emmanuel Hadoux <>
Submitted on : Thursday, September 17, 2015 - 11:49:24 AM
Last modification on : Thursday, March 21, 2019 - 1:21:05 PM
Document(s) archivé(s) le : Tuesday, December 29, 2015 - 7:43:39 AM


Files produced by the author(s)


  • HAL Id : hal-01200822, version 1


Emmanuel Hadoux, Aurélie Beynier, Nicolas Maudet, Paul Weng, Anthony Hunter. Optimization of Probabilistic Argumentation With Markov Decision Models. International Joint Conference on Artificial Intelligence, Jul 2015, Buenos Aires, Argentina. ⟨hal-01200822⟩



Record views


Files downloads