Bargaining theory with applications
Bargaining theory with applications
A negotiation-style framework for non-prioritised revision
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Revisions of knowledge systems using epistemic entrenchment
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Logical foundations of negotiation: outcome, concession and adaptation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Negotiation as mutual belief revision
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A computational model of logic-based negotiation
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A logical model of Nash bargaining solution
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A Fixed-Point Property of Logic-Based Bargaining Solution
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An ordinal bargaining solution with fixed-point property
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
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 $\Delta^P_2[\mathcal{O}(\log n)]$.