Skip to main content

Proposal-Based Negotiation in Convex Regions

  • Conference paper
Cooperative Information Agents VII (CIA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2782))

Included in the following conference series:

Abstract

In this work we analyze negotiation between two partially cooperative agents, which are supposed to find an agreement which satisfies both of them minimizing the number of iterations. Our goal is to understand the role that reasoning can play in speeding up the search for an agreement. We do not put any limit on the number of shared variables and constraints, and analyze the negotiation problem under the hypothesis that the admissibility regions for each agent are convex. Under such a framework, we show how an agent can perform a sophisticated form of reasoning, which can be formalized by means of projections on the other agent’s proposals. The main technical result of this paper is that projections can be very effective in speeding up negotiation; in particular, we show by means of several examples that reasoning about the other agent’s reasoning using projections allows a protocol which is, in some cases, very efficient. We also investigate the intrinsic limits of the methodology, showing that there are some worst-case scenarios in which the number of exchanged proposals is exponential both in the number of variables and in the number of constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armstrong, A., Durfee, E.H.: Dynamic prioritization of complex agents in distributed constraint satisfaction. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 620–625 (1997)

    Google Scholar 

  2. Conry, S.E., Kuwabara, K., Lesser, R.A., Meyer, V.R.: Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man and Cybernetics 21(6), 462–477 (1991)

    Article  Google Scholar 

  3. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. The MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  4. Faratin, P., Sierra, C., Jennings, N.R.: Negotiation decision functions for autonomous agents. International Journal of Robotics and Autonomous Systems 24(3-4), 159–182 (1998)

    Article  Google Scholar 

  5. Hintikka, J.: Knowledge and belief. Cornell University Press, Ithaca (1962)

    Google Scholar 

  6. Jennings, N.R., Faratin, P., Sierra, C.: Automated negotiation: Prospects, methods and challenges. Group Decision and Negotiation 10, 199–215 (2001)

    Article  Google Scholar 

  7. Jung, H., Tambe, M., Shriniwas, K.: Argumentation as distributed constraint satisfaction: applications and results. In: Proceedings of the Fifth International Conference on Autonomous Agents (Agents 2001), pp. 324–331. ACM Press, New York (2001)

    Chapter  Google Scholar 

  8. Kraus, S.: Negotiation and cooperation in multi-agent environments. Artificial Intelligence 94(1-2), 79–98 (1997)

    Article  MATH  Google Scholar 

  9. Rosenschein, J.S., Zlotkin, G.: Rules of Encounter: Designing Conventions for Automated Negotiations Among Computers. The MIT Press, Cambridge (1994)

    Google Scholar 

  10. Sycara, K.P., Roth, S., Sadeh, N., Fox, M.: Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics 21(6), 446–461 (1991)

    Article  Google Scholar 

  11. Woolridge, M., Parsons, S.: Languages for negotiation. In: Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI 2000), pp. 393–397 (2000)

    Google Scholar 

  12. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 10(5), 673–685 (1998)

    Article  Google Scholar 

  13. Yokoo, M., Katsutoshi, H.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agents Systems 3(2), 185–207 (2000)

    Article  Google Scholar 

  14. Zlotkin, G., Rosenschein, J.S.: Mechanisms for automated negotiation in state oriented domains. Journal of Artificial Intelligence Research 5, 163–238 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cadoli, M. (2003). Proposal-Based Negotiation in Convex Regions. In: Klusch, M., Omicini, A., Ossowski, S., Laamanen, H. (eds) Cooperative Information Agents VII. CIA 2003. Lecture Notes in Computer Science(), vol 2782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45217-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45217-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40798-0

  • Online ISBN: 978-3-540-45217-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics