@inproceedings{bd7f600df8884f9f9fa889ad1713721a,
title = "Logical properties of belief-revision-based bargaining solution",
abstract = "This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized belief revision. With the construction, the computation of bargaining solution can be converted to the calculation of maximal consistent hierarchy of prioritized belief sets. We prove that the syntax-independent solution of bargaining satisfies a set of desired logical properties for agreement function and negotiation function. Finally we show that the computational complexity of beliefrevision- based bargaining can be reduced to δP2 [O(log n)].",
keywords = "Automated negotiation, Bargaining theory, Belief revision",
author = "Dongmo Zhang and Yan Zhang",
year = "2006",
doi = "10.1007/11941439_12",
language = "English",
isbn = "9783540497875",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "79--89",
booktitle = "AI 2006",
note = "19th Australian Joint Conference onArtificial Intelligence, AI 2006 ; Conference date: 04-12-2006 Through 08-12-2006",
}