A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 251-255.
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é
@inproceedings{ijcai2009p51,
title = {A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics},
author = {Rahwan, Iyad and Larson, Kate and Tohmé, Fernando A.},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {251--255},
year = {2009},
url = {https://ijcai.org/proceedings/2009/51},
}
TY - CPAPER TI - A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics AU - Rahwan, Iyad AU - Larson, Kate AU - Tohmé, Fernando A. T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 251 EP - 255 UR - https://ijcai.org/proceedings/2009/51 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
