Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 435))

Abstract

We propose correct and efficient algorithms for locating the optimal contract of negotiating agents that represent their utility space with the constraints based utility space model. It is argued that the agents that use the model can be classified in to two extreme kinds: sensitive and insensitive. When the negotiation is between a sensitive agent and many in- sensitive agents, the optimal contract can be computed correctly and efficiently by avoiding Exhaustive Matching.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Fujita, K., Ito, T., Klein, M., Hattori, H.: An approach to implementing a threshold adjusting mechanism in very complex negotiations a preliminary result. In: KICSS, pp. 185–192 (2007)

    Google Scholar 

  2. Fujita, K., Ito, T., Klein, M.: Effects of revealed area based selection method for representative based protocol. In: ACAN (2008)

    Google Scholar 

  3. Hattori, H., Klein, M., Ito, T.: Using iterative narrowing to enable multi-party negotiations with multiple interdependent issues. In: AAMAS, pp. 1043–1045 (2007)

    Google Scholar 

  4. Ito, T., Hattori, H., Klein, M.: Multi-issue negotiation protocol for agents exploring nonlinear utility spaces. In: IJCAI, pp. 1347–1352 (2007)

    Google Scholar 

  5. Marsa-Maestre, I., Lopez-Carmona, M.A., de la Hoz, E.: Effective bidding and deal identification for negotiations in highly nonlinear scenarios. In: AAMAS, pp. 1057–1064 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Raiye Hailu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hailu, R., Ito, T. (2013). Efficient Deal Identification for the Constraints Based Utility Space Model. In: Ito, T., Zhang, M., Robu, V., Matsuo, T. (eds) Complex Automated Negotiations: Theories, Models, and Software Competitions. Studies in Computational Intelligence, vol 435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30737-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30737-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30736-2

  • Online ISBN: 978-3-642-30737-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics