A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics
Abstract
Recently, Argumentation Mechanism Design (ArgMD) was introduced as a new paradigm for studying argumentation among self-interested agents using game-theoretic techniques. Preliminary results showed a condition under which a direct mechanism based on Dung's grounded semantics is strategy-proof (i.e. truth enforcing). But these early results dealt with a highly restricted form of agent preferences, and assumed agents can only hide, but not lie about, arguments. In this paper, we characterise strategy-proofness under grounded semantics for a more realistic preference class (namely, focal arguments). We also provide the first analysis of the case where agents can lie. Iyad Rahwan, Kate Larson, Fernando Tohm�
Cite
Text
Rahwan et al. "A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Rahwan et al. "A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/rahwan2009ijcai-characterisation/)BibTeX
@inproceedings{rahwan2009ijcai-characterisation,
title = {{A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics}},
author = {Rahwan, Iyad and Larson, Kate and Tohmé, Fernando A.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {251-256},
url = {https://mlanthology.org/ijcai/2009/rahwan2009ijcai-characterisation/}
}