Skip to main content

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

Abstract

Although multiagent negotiation is usually seen as a process that had to seek the consensus of all the participants, there are situations where unanimous agreement either is not possible or simply the rules imposed by the system do not allow such unanimous agreement. One of this situations is consortium formation in brokerage events where a grand coalition is no viable and an optimal group partition is expected in order to maximize the probability of success of the different consortia. In this paper we propose a novel framework, consensus policy based mediation framework (CPMF), to be able to perform multiagent negotiations where the type of consensus by which an agreement meets in some specific manner the concerns of all the negotiators is considered as an integral part within the multiparty negotiation protocols. CPMF relies on a novel distributed agreement exploration protocol based on the optimization technique (GPS) and on the use of Ordered Weighted Averaging (OWA) operators for the aggregation of the agent preferences on the set of alternatives proposed by the mediator in each negotiation round. The mediation rules allow for a linguistic description of the type of agreements needed. A possible application of CPMF to a real-world scenario is shown. Experiments show that CPMF is able to manage negotiations efficiently following predefined consensus policies offering agreements for situations where quorum is not viable.

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
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. Dang, V.D., Dash, R.K., Rogers, A., Jennings, N.R.: Overlapping coalition formation for efficient data fusion in multi-sensor networks. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, vol. 1, pp. 635–640. AAAI Press (2006)

    Google Scholar 

  2. Ehtamo, H., Hamalainen, R.P., Heiskanen, P., Teich, J., Verkama, M., Zionts, S.: Generating pareto solutions in a two-party setting: constraint proposal methods. Management Science 45(12), 1697–1709 (1999)

    Article  MATH  Google Scholar 

  3. Heiskanen, P., Ehtamo, H., Hamalainen, R.P.: Constraint proposal method for computing pareto solutions in multi-party negotiations. European Journal of Operational Research 133(1), 44–61 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ito, T., Klein, M., Hattori, H.: A multi-issue negotiation protocol among agents with nonlinear utility functions. Journal of Multiagent and Grid Systems 4(1), 67–83 (2008)

    MATH  Google Scholar 

  5. Klein, M., Faratin, P., Sayama, H., Bar-Yam, Y.: Protocols for negotiating complex contracts. IEEE Intelligent Systems 18(6), 32–38 (2003)

    Article  Google Scholar 

  6. Kohlberg, E.: On the nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics 20(1), 62–66 (1971), http://www.jstor.org/stable/2099885

    Article  MathSciNet  MATH  Google Scholar 

  7. Lai, G., Sycara, K.: A generic framework for automated multi-attribute negotiation. Group Decision and Negotiation 18, 169–187 (2009)

    Article  Google Scholar 

  8. Lau, H.C., Zhang, L.: Task allocation via multi-agent coalition formation: Taxonomy, algorithms and complexity. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2003, p. 346. IEEE Computer Society, Washington, DC (2003), http://dl.acm.org/citation.cfm?id=951951.952314

    Google Scholar 

  9. Lewis, R.M., Torczon, V., Trosset, M.W.: Direct search methods: then and now. Journal of Computational and Applied Mathematics 124, 191–207 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Li, M., Vo, Q.B., Kowalczyk, R.: Searching for fair joint gains in agent-based negotiation. In: Decker, Sichman, Sierra, Castelfranchi (eds.) Proc. of 8th Int. Conf. on Autonomous Agents and Multiagent Systems, AAMAS 2009, Budapest, Hungary, pp. 1049–1056 (2009)

    Google Scholar 

  11. Lopez-Carmona, M.A., Marsa-Maestre, I., De La Hoz, E., Velasco, J.R.: A region-based multi-issue negotiation protocol for nonmonotonic utility spaces. Computational Intelligence 27(2), 166–217 (2011), doi:10.1111/j.1467-8640.2011.00377.x

    Article  MathSciNet  MATH  Google Scholar 

  12. Lopez-Carmona, M.A., Marsa-Maestre, I., Ibanez, G., Carral, J.A., Velasco, J.R.: Improving trade-offs in automated bilateral negotiations for expressive and inexpressive scenarios. Journal of Intelligent & Fuzzy Systems 21, 165–174 (2010)

    Google Scholar 

  13. Lopez-Carmona, M.A., Marsa-Maestre, I., Klein, M., Ito, T.: Addressing stability issues in mediated complex contract negotiations for constraint-based, non-monotonic utility spaces. Journal of Autonomous Agents and Multiagent Systems, 1–51 (2010) (published online)

    Google Scholar 

  14. Marsa-Maestre, I., Lopez-Carmona, M.A., Velasco, J.R., Ito, T., Klein, M., Fujita, K.: Balancing utility and deal probability for auction-based negotiations in highly nonlinear utility spaces. In: 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, Pasadena, California, USA, pp. 214–219 (2009)

    Google Scholar 

  15. Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Anytime coalition structure generation with worst case guarantees. In: Proceedings of the Fifteenth National/Tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, AAAI 1998/IAAI 1998, pp. 46–53. American Association for Artificial Intelligence, Menlo Park (1998)

    Google Scholar 

  16. Tsvetovat, M., Sycara, K., Chen, Y., Ying, J.: Customer Coalitions in Electronic Markets. In: Dignum, F., Cortés, U. (eds.) AMEC 2000. LNCS (LNAI), vol. 2003, pp. 121–138. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Vo, Q.B., Padgham, L., Cavedon, L.: Negotiating flexible agreements by combining distributive and integrative negotiation. Intelligent Decision Technologies 1(1-2), 33–47 (2007)

    Google Scholar 

  18. Yager, R.: Quantifier guided aggregation using owa operators. International Journal of Intelligent Systems 11, 49–73 (1996)

    Article  Google Scholar 

  19. Yager, R., Kacprzyk, J.: The Ordered Weighted Averaging Operators: Theory and Applications. Kluwer (1997)

    Google Scholar 

  20. Zadeh, L.: A computational approach to fuzzy quantifiers in natural languages. Computing and Mathematics with Applications 9, 149–184 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

de la Hoz, E., Lopez-Carmona, M.A., Klein, M., Marsa-Maestre, I. (2013). Consortium Formation Using a Consensus Policy Based Negotiation Framework. 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_1

Download citation

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

  • 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