Logical Properties of Belief-Revision-Based Bargaining Solution

Abstract

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 Δ

A Fixed-Point Property of Logic-Based Bargaining Solution

“…Meyer et al gave a construction of negotiation function based on belief revision and discussed their logical properties [9,10]. Zhang and Zhang presented another belief-revision-based bargaining solution [12,13], which is similar to ours. However it is not too hard to verify that none of the above mentioned solutions satisfies the fixed-point property.…”

“…This paper aims to build a concrete bargaining solution to satisfy the fixed-point condition. The construction of the solution is based on the bargaining model proposed by Zhang and Zhang in [12,13]. The result of the paper not only shows the logical property of bargaining but also establishes the link between bargaining and belief revision, which may be helpful for the investigation of multi-agent belief revision.…”