@inproceedings{2bbb7166cec74b27bb680a5c4840a261,
title = "A computational model of logic-based negotiation",
abstract = "This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining game without using lotteries. Its game-theoretic properties are discussed against the existence and uniqueness of Nash equilibrium and subgame perfect equilibrium. We also study essential computational properties in relation to our negotiation model. In particular, we show that the deal membership checking is DP-complete and the corresponding agreement inference problem is ∏2P-hard.",
author = "Dongmo Zhang and Yan Zhang",
year = "2006",
language = "English",
isbn = "1577352815",
series = "Proceedings of the National Conference on Artificial Intelligence",
pages = "728--733",
booktitle = "Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06",
note = "21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 ; Conference date: 16-07-2006 Through 20-07-2006",
}