Skip to main content

Interest Based Negotiation Automation

  • Conference paper
Computational Intelligence and Bioinformatics (ICIC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4115))

Included in the following conference series:

Abstract

The negotiation in general sense, as one of the most fundamental and powerful interaction of human beings, represents the dynamic process of exchanging information and perspectives towards mutual understanding and agreements. Interest based negotiation allows negotiators to discuss the concerns behind the negotiation issues so that a mutually acceptable win-win solution is more likely to be reached. This paper, for the first time, proposes a computational model for interest based negotiation automation which enables the automation of the fundamental elements of negotiation. Based on the model, algorithms are designated to automate the fundamental elements with practical computational complexity. This model provides not only a theoretical foundation for software agent based negotiation automation, but also a practical approach.

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 84.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

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. Fisher, R., Ury, W.: Getting to Yes: Negotiating Agreement without giving in. Penguin boks, New York (1983)

    Google Scholar 

  2. Jennings, N.R., Faratin, P., Lomuscio, A.R., Parsons, S., Sierra, C., Wooldridge, M.: Automated Negotiation: Prospects, Methods and Challenges. Int. Journal of Group Decision and Negotiation 10(2), 199–215 (2001)

    Article  Google Scholar 

  3. Hu, W.B., Wang, S.M.: Research on the Negotiation Mechanism of Multi-agent System Based on Game Theory. In: Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, vol. 1, pp. 396–400 (2005)

    Google Scholar 

  4. Chen, J.H., Chao, K.M., Godwin, N., Reeves, C., Smith, P.: An Automated Negotiation Mechanism Based on Co-evolution and Game Theory. In: Proceedings of the 2002 ACM symposium on Applied computing, pp. 63–67 (2002)

    Google Scholar 

  5. Faratin, P., Sierra, C., Jennings, N.R.: Using Similarity Criteria to Make Issue Trade-offs in Automated Negotiations. Journal of Artificial Intelligence 142(2), 205–237 (2002)

    Article  MathSciNet  Google Scholar 

  6. Jonker, C., Robu, V.: Automated Multi-Attribute Negotiation with Efficient Use of Incomplete Preference Information. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1054–1061 (2004)

    Google Scholar 

  7. Karunatillake, N.C., Jennings, N.R., Rahwan, I., Norman, T.J.: Argument-based Negotiation in a Social Context. In: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pp. 1331–1332 (2005)

    Google Scholar 

  8. Rahwan, I., Ramchurn, S.D., Jennings, N.R., McBurney, P., Parsons, S., Sonenberg, L.: Argumentation-based Negotiation. The Knowledge Engineering Review 18(4), 343–375 (2004)

    Article  Google Scholar 

  9. Rahwan, I., Sonenberg, L., Dignum, F.: On Interest Based Negotiation. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol. 2922, pp. 383–401. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Aspvall, B., Plass, M., Tarjan, R.: A Linear-time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters, 121–123 (1979)

    Google Scholar 

  11. Subramani, K.: Optimal Length Tree-Like Resolution Refutations for 2SAT Formulas. ACM Transactions on Computational Logic 5(2), 316–320 (2004)

    Article  MathSciNet  Google Scholar 

  12. Robinson, J.A.: A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM 12, 23–41 (1965)

    Article  MATH  Google Scholar 

  13. Eiter, T., Gottlob, G.: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence 57(2-3), 227–270 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Tao, X.H., Sun, W., Ma, S.H.: A Practical Propositional Knowledge Base Revision Algorithm. Journal of Computer Science and Technology 12(2), 154–159 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tao, X., Miao, Y., Shen, Z., Miao, C., Yelland, N. (2006). Interest Based Negotiation Automation. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_23

Download citation

  • DOI: https://doi.org/10.1007/11816102_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37277-6

  • Online ISBN: 978-3-540-37282-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics