Abstract
This paper considers the design of negotiation protocols for logic-based agent communication languages. We begin by motivating the use of such languages, and introducing a formal model of logic-based negotiation. Using this model, we define two important computational problems: the success problem (given a particular negotiation history, has agreement been reached?) and the guaranteed success problem (does a particular negotiation protocol guarantee that agreement will be reached?) We then consider a series of progressively more complex negotiation languages, and consider the complexity of using these languages. We conclude with a discussion on related work and issues for the future.
This research was supported by the EPSRC under grant GR/M07076 and the EC under grant IST-1999-10998 (SLIE).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Binmore. Fun and Games: A Text on Game Theory. D. C. Heath and Company: Lexington, MA, 1992.
H. B. Enderton. A Mathematical Introduction to Logic. The Academic Press: London, England, 1972.
FIPA. Specification part 2 — Agent communication language, 1999. The text refers to the specification dated 16 April 1999.
D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Volume A: Algorithms and Complexity, pages 67–161. Elsevier Science Publishers B.V.: Amsterdam, The Netherlands, 1990.
S. Kraus. Negotiation and cooperation in multi-agent environments. Artificial Intelligence, 94(1–2):79–98, July 1997.
J. Mayfield, Y. Labrou, and T. Finin. Evaluating KQML as an agent communication language. In M. Wooldridge, J. P. Müller, and M. Tambe, editors, Intelligent Agents II (LNAI Volume 1037), pages 347–360. Springer-Verlag: Berlin, Germany, 1996.
P. Noriega and C. Sierra, editors. Agent Mediated Electronic Commerce (LNAI Volume 1571). Springer-Verlag: Berlin, Germany, 1999.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994.
J. S. Rosenschein and G. Zlotkin. Rules of Encounter: Designing Conventions for Automated Negotiation among Computers. The MIT Press: Cambridge, MA, 1994.
T. Sandholm. Distributed rational decision making. In G. Weiß, editor, Multiagent Systems, pages 201–258. The MIT Press: Cambridge, MA, 1999.
Carles Sierra, Nick R. Jennings, Pablo Noriega, and Simon Parsons. A framework for argumentation-based negotiation. In M. P. Singh, A. Rao, and M. J. Wooldridge, editors, Intelligent Agents IV (LNAI Volume 1365), pages 177–192. Springer-Verlag: Berlin, Germany, 1998.
M. Wooldridge and S. Parsons. Languages for negotiation. In Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI-2000), Berlin, Germany, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wooldridge, M., Parsons, S. (2001). Issues in the Design of Negotiation Protocols for Logic-Based Agent Communication Languages. In: Dignum, F., Cortés, U. (eds) Agent-Mediated Electronic Commerce III. AMEC 2000. Lecture Notes in Computer Science(), vol 2003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44723-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-44723-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41749-1
Online ISBN: 978-3-540-44723-8
eBook Packages: Springer Book Archive