Skip to main content

A Comparative Study on Vector Similarity Methods for Offer Generation in Multi-attribute Negotiation

  • Conference paper
  • First Online:
AI 2015: Advances in Artificial Intelligence (AI 2015)

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

Included in the following conference series:

  • 1536 Accesses

Abstract

Offer generation is an important mechanism in automated negotiation, in which a negotiating agent needs to select bids close to the opponent preference to increase their chance of being accepted. The existing offer generation approaches are either random, require partial knowledge of opponent preference or are domain-dependent. In this paper, we investigate and compare two vector similarity functions for generating offer vectors close to opponent preference. Vector similarities are not domain-specific, do not require different similarity functions for each negotiation domain and can be computed in incomplete-information negotiation. We evaluate negotiation outcomes by the joint gain obtained by the agents and by their closeness to Pareto-optimal solutions.

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 EPUB and 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

Notes

  1. 1.

    In this paper, agents do not reveal their utility function to their opponent.

References

  1. Baarslag, T., Hindriks, K., Hendrikx, M., Dirkzwager, A., Jonker, C.: Decoupling negotiating agents to explore the space of negotiation strategies. Novel Insights in Agent-Based Complex Automated Negotiation, pp. 61–83. Springer, Berlin (2014)

    Chapter  Google Scholar 

  2. Dirkzwager, A.S.Y.: Towards understanding negotiation strategies: analyzing the dynamics of strategy components (2013)

    Google Scholar 

  3. Chen, S., Weiss, G.: A novel strategy for efficient negotiation in complex environments. In: Timm, I.J., Guttmann, C. (eds.) MATES 2012. LNCS, vol. 7598, pp. 68–82. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Williams, C.R., Robu, V., Gerding, E.H., Jennings, N.R.: Iamhaggler 2011: a gaussian process regression based negotiation agent. Complex Automated Negotiations: Theories, Models, and Software Competitions, pp. 209–212. Springer, Berlin (2013)

    Chapter  Google Scholar 

  5. Baarslag, T., Hindriks, K., Jonker, C., Kraus, S., Lin, R.: The first automated negotiating agents competition (ANAC 2010). In: Ito, T., Zhang, M., Robu, V., Fatima, S., Matsuo, T. (eds.) New Trends in Agent-Based Complex Automated Negotiations. SCI, vol. 383, pp. 113–135. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Faratin, P., Sierra, C., Jennings, N.R.: Using similarity criteria to make issue trade-offs in automated negotiations. Artif. Intell. 142, 205–237 (2002)

    Article  MathSciNet  Google Scholar 

  7. Korenius, T., Laurikkala, J., Juhola, M.: On principal component analysis, cosine and Euclidean measures in information retrieval. Inf. Sci. 177, 4893–4905 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Nguyen, H.V., Bai, L.: Cosine similarity metric learning for face verification. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part II. LNCS, vol. 6493, pp. 709–720. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Karnik, A., Goswami, S., Guha, R.: Detecting obfuscated viruses using cosine similarity analysis. In: Modelling and Simulation. In: First Asia International Conference on AMS 2007, pp. 165–170. IEEE (2007)

    Google Scholar 

  10. Ragone, A., Di Noia, T., Di Sciascio, E., Donini, F.M.: Propositional-logic approach to one-shot multi issue bilateral negotiation. ACM SIGecom Exch. 5, 11–21 (2006)

    Article  Google Scholar 

  11. Coehoorn, R.M., Jennings, N.R.: Learning on opponent’s preferences to make effective multi-issue negotiation trade-offs. Presented at the (2004)

    Google Scholar 

  12. Jazayeriy, H., Azmi-Murad, M., Sulaiman, N., Izura Udizir, N.: The learning of an opponent’s approximate preferences in bilateral automated negotiation. J. Theor. Appl. Electron. Commer. Res. 6, 65–84 (2011)

    Article  Google Scholar 

  13. Ros, R., Sierra, C.: A negotiation meta strategy combining trade-off and concession moves. Auton. Agent. Multi-Agent Syst. 12, 163–181 (2006)

    Article  Google Scholar 

  14. Cheng, C.-B., Chan, C.-C.H., Lin, K.-C.: Intelligent agents for e-marketplace: negotiation with issue trade-offs by fuzzy inference systems. Decis. Support Syst. 42, 626–638 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aodah Diamah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Diamah, A., Wagner, M., van den Briel, M. (2015). A Comparative Study on Vector Similarity Methods for Offer Generation in Multi-attribute Negotiation. In: Pfahringer, B., Renz, J. (eds) AI 2015: Advances in Artificial Intelligence. AI 2015. Lecture Notes in Computer Science(), vol 9457. Springer, Cham. https://doi.org/10.1007/978-3-319-26350-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26350-2_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26349-6

  • Online ISBN: 978-3-319-26350-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics