Abstract
This paper presents a logic-program-based mechanism of negotiation between two agents. In this mechanism an extended logic program (ELP) is regarded as an agent. The negotiation process between two agents is then modelled as multiple encounters between two ELPs, each of which selects an answer set as its initial demand. Both agents mutually revise the original sets of demands through accepting part of the opponent's demand and/or giving up part of its own demand. The overall dynamics can be regarded as mutual updates between two extended logic programs. A deal to achieve an appropriate negotiation solution is put forward. The conditions of existence and terminability of an appropriate negotiation are given. Properties of a negotiation solution are discussed, including its weak Pareto optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Littman M L, Stone P. Implicit negotiation in repeated games. In Proc. the 8th International Workshop on Agent Theories, Architectures, and Languages (ATAL-2001), Seattle, USA, August 1–3, 2001, pp.393–404.
Sabourian H, Lee J. Complexity and e±ciency in repeated games with negotiation. In Proc. 2004 North American Summer Meeting of the Econometric Society, Providence, USA, June 17–20, 2004, Paper 58.
Alchourrón C E, Gärdenfors P, Makinson D. On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic, 1985, 50(2): 510–530.
Zhang D, Foo N. Infinitary belief revision. Journal of Philosophical Logic, 2001, 30(6): 525–570.
Zhang D, Foo N, Meyer T et al. Negotiation as mutual belief revision. In Proc. the 19th National Conf. Artificial Intelligence (AAAI'04), San Jose, USA, July 25–29, 2004, pp.317–323.
Foo N, Meyer T, Zhang Y et al. Negotiating logic programs. In Proc. the Sixth Workshop on Nonmonotonic Reasoning, Action and Change (NRAC'05), Edinburgh, Scotland, August 1, 2005, pp.39–44.
Zhang Y, Foo N. Solving logic program conflict through strong and weak forgettings. Artificial Intelligence, 2006, 170(8): 739–778.
Gelfond M, Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Computing, 1991, 9(3/4): 365–386.
Lifschitz V. Foundations of Logic Programming. Principles of Knowledge Representation, Gerhard Brewka (ed.), Standford: CSLI Publications, July 31, 1996, pp.69–127.
Fudenberg D, Tirole J. Game Theory. Cambridge, Mass.: MIT Press, August 29, 1991.
Gardenfors P. Knowledge in Flux: Modelling the Dynamics of Epistemic States. Cambridge, Mass.: MIT Press, July 1988.
Zhang M, Zhang Y, Lin F. A characterization of answer sets for logic programs. Science in China Series F: Information Sciences, 2007, 50(1): 46–62.
Zhang D, Zhang Y. A computational model of logic-based negotiation. In Proc. the 21st National Conference on Artificial Intelligence (AAAI'06), Boston, USA, July 16–20, 2006, pp.728–733.
Lifschitz V, Tang L R, Turner H. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 1999, 25(3/4): 369–389.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China under Grant Nos.90718009, 60703095.
Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Chen, W., Zhang, MY. & Wu, MN. A Logic-Program-Based Negotiation Mechanism. J. Comput. Sci. Technol. 24, 753–760 (2009). https://doi.org/10.1007/s11390-009-9256-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-009-9256-x