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.
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
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)
Fujita, K., Ito, T., Klein, M.: Effects of revealed area based selection method for representative based protocol. In: ACAN (2008)
Hattori, H., Klein, M., Ito, T.: Using iterative narrowing to enable multi-party negotiations with multiple interdependent issues. In: AAMAS, pp. 1043–1045 (2007)
Ito, T., Hattori, H., Klein, M.: Multi-issue negotiation protocol for agents exploring nonlinear utility spaces. In: IJCAI, pp. 1347–1352 (2007)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)