Skip to main content

Learning Agents in Automated Negotiations

  • Conference paper
Information Systems, Technology and Management (ICISTM 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 31))

  • 1334 Accesses

Abstract

In bilateral multi-issue negotiations involving two-sided information uncertainty, selfish agents participating in a distributed search of the solution space need to learn the opponent’s preferences from the on-going negotiation interactions and utilize such knowledge to construct future proposals in order to hope to arrive at efficient outcomes. Besides, negotiation support systems that inhibit strategic misrepresentation of information need to be in place in order to assist the protagonists to obtain truly efficient solutions. To this end, this work suggests an automated negotiation procedure that while protecting the information privacy of the participating agents encourages truthful revelation of information through successive proposals. Further we present an algorithm for proposal construction in the case of two continuous issues. When both the negotiating agents implement the algorithm the negotiation trace shall be confined to the Pareto frontier. The Pareto-optimal deal close to the Nash solution shall be located whenever such a deal exists.

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. Roth, A.E.: Game-theoretic models of bargaining. Cambridge University Press, New York (2005)

    Google Scholar 

  2. Nash, J.F.: The bargaining problem. Econometrica 18, 155–162 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  3. Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50, 97–109 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Holmstrom, B., Myerson, R.B.: Efficient and durable decision rules with Incomplete information. Econometrica 51, 1799–1819 (1983)

    Article  MATH  Google Scholar 

  5. Raiffa, H.: The Art and Science of Negotiation. Harvard University Press, Cambridge (1982)

    Google Scholar 

  6. Heiskanen, P.: Decentralized method for computing Pareto solutions in multiparty negotiations. European Journal of Operational Research 117, 578–590 (1999)

    Article  MATH  Google Scholar 

  7. Heiskanen, P., Ehtamo, H., Hämäläinen, R.P.: Constraint proposal method for computing Pareto solutions in multi-party negotiations. European J. Oper. Res. 133(1), 44–61 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Luo, X., Jennings, N.R., Shadbolt, N., Leung, H., Lee, J.H.: A fuzzy constraint based model for bilateral multi-issue negotiations in semi-competitive environments. Artificial Intelligence 148, 53–102 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Lin, R.J., Chou, S.T.: Mediating a bilateral multi-issue negotiation. Electronic Commerce Research and Applications 3, 126–138 (2004)

    Article  Google Scholar 

  11. Ehtamo, H., Verkama, M., Hamalainen, R.P.: How to Select Fair Improving Directions in a Negotiation Model over Continuous Issues. IEEE Transactions on Systems, Man, and Cybernetics – Part C: Applications and Reviews 29(1) (February 1999)

    Google Scholar 

  12. Barbuceanu, M., Lo, W.: A Multi-Attribute Utility Theoretic Negotiation Architecture for Electronic Commerce. In: Proceedings of 4th Int. Conf. on Autonomous Agents, Barcelona, Spain, pp. 239–247 (2000)

    Google Scholar 

  13. Shakun, M.F.: Multi-bilateral Multi-issue E-negotiation in E-commerce with a Tit-for-Tat Computer Agent. Group Decision and Negotiation 14, 383–392 (2005)

    Article  Google Scholar 

  14. Coehoorn, R.M., Jennings, N.R.: Learning an Opponent’s Preferences to Make Effective Multi-Issue Negotiation Trade-Offs. In: Proceedings of Sixth International Conference on Electronic Commerce, ICEC 2004 (2004)

    Google Scholar 

  15. Zeng, Z., Meng, B., Zeng, Y.: An Adaptive Learning Method in Automated Negotiation based on Artificial Neural Network. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics (August 2005)

    Google Scholar 

  16. Lau, R.Y.K., Tang, M., Wong, O.: Towards Genetically Optimized Responsive Negotiation Agents. In: Proceedings of the IEEE/WIC/ACM Int. Conf. on Intelligent Agent Technology, IAT 2004 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chandrashekhar, H., Bhasker, B. (2009). Learning Agents in Automated Negotiations. In: Prasad, S.K., Routray, S., Khurana, R., Sahni, S. (eds) Information Systems, Technology and Management. ICISTM 2009. Communications in Computer and Information Science, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00405-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00405-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00404-9

  • Online ISBN: 978-3-642-00405-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics