Logical properties of belief-revision-based bargaining solution

Dongmo Zhang; Yan Zhang

Logical properties of belief-revision-based bargaining solution

School of Computer, Data & Mathematical Sciences

Research output: Chapter in Book / Conference Paper › Conference Paper

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 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

Cite this

@inproceedings{6cc5f26c3f6a41529922256cb3afbbb4,

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 belief-revision-based bargaining can be reduced to {\^a}ˆ†P 2 [O(log n)].",

keywords = "belief revision, bargaining theory, automated negotiation",

author = "Dongmo Zhang and Yan Zhang",

year = "2006",

language = "English",

isbn = "9783540497875",

booktitle = "AI 2006 : Advances in Artificial Intelligence: 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006 - Proceedings",

publisher = "Springer",

note = "Australian Joint Conference on Artificial Intelligence ; Conference date: 01-01-2006",

}

TY - GEN

T1 - Logical properties of belief-revision-based bargaining solution

AU - Zhang, Dongmo

AU - Zhang, Yan

PY - 2006

Y1 - 2006

N2 - 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)].

AB - 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)].

KW - belief revision

KW - bargaining theory

KW - automated negotiation

UR - http://handle.uws.edu.au:8081/1959.7/36405

M3 - Conference Paper

SN - 9783540497875

BT - AI 2006 : Advances in Artificial Intelligence: 19th Australian Joint Conference on Artificial Intelligence, Hobart, Australia, December 4-8, 2006 - Proceedings

PB - Springer

T2 - Australian Joint Conference on Artificial Intelligence

Y2 - 1 January 2006

ER -

Logical properties of belief-revision-based bargaining solution

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this