Abstract
![CDATA[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 belief-revision-based bargaining can be reduced to ∆P 2 [O(log n)].]]
Original language | English |
---|---|
Title of host publication | AI 2006 : Advances in Artificial Intelligence: 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006 - Proceedings |
Publisher | Springer |
Number of pages | 11 |
ISBN (Print) | 9783540497875 |
Publication status | Published - 2006 |
Event | Australian Joint Conference on Artificial Intelligence - Duration: 1 Jan 2006 → … |
Conference
Conference | Australian Joint Conference on Artificial Intelligence |
---|---|
Period | 1/01/06 → … |
Keywords
- belief revision
- bargaining theory
- automated negotiation