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 \(\Delta^P_2[\mathcal{O}(\log n)]\).
This work is partially supported by UWS Research Grant Scheme.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alchourrón, E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. The Journal of Symbolic Logic 50(2), 510–530 (1985)
Booth, R.: A negotiation-style framework for non-prioritised revision. TARK: Theoretical Aspects of Reasoning about Knowledge, 137–150 (2001)
Gärdenfors, P., Makinson, D.: Revisions of knowledge systems using epistemic entrenchment. In: Proceedings of TARK, pp. 83–95 (1988)
Meyer, T., Foo, N., Kwok, R., Zhang, D.: Logical foundations of negotiation: outcome, concession and adaptation. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 293–298 (2004)
Meyer, T., Foo, N., Kwok, R., Zhang, D.: Logical foundations of negotiation: strategies and preferences. In: Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoing (KR 2004), pp. 311–318 (2004)
Muthoo, A.: Bargaining Theory with Applications. Cambridge University Press, Cambridge (1999)
Nebel, B.: How Hard is it to Revise a Belief Base? In: Dubois, D., Prade, H. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, Belief Change, vol. 3, pp. 77–145. Kluwer Academic, Dordrecht (1998)
Nebel, B.: Syntax-Based Approaches to Belief Revision. In: Gärdenfors, P. (ed.) Belief Revision, pp. 52–88. Cambridge University Press, Cambridge (1992)
Osborne, M.J., Rubinstein, A.: Bargaining and Markets. Academic Press, London (1990)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Roth, A.: Axiomatic Models of Bargaining. Springer, Heidelberg (1979)
Rubinstein, A.: Economics and Language: Five Essays. Cambridge University Press, Cambridge (2000)
Zhang, D., Foo, N.: Infinitary belief revision. Journal of Philosophical Logic 30(6), 525–570 (2001)
Zhang, D., Foo, N., Meyer, T., Kwok, R.: Negotiation as mutual belief revision. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 317–322 (2004)
Zhang, D.: A logical model for Nash bargaining solution. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 983–988 (2005)
Zhang, D., Zhang, Y.: A computational model of logic-based negotiation. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), pp. 728–733 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, D., Zhang, Y. (2006). Logical Properties of Belief-Revision-Based Bargaining Solution. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_12
Download citation
DOI: https://doi.org/10.1007/11941439_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)