Skip to main content
SpringerLink
Log in
Book cover

Modern Approaches to Agent-based Complex Automated Negotiation pp 67–84Cite as

Using Graph Properties and Clustering Techniques to Select Division Mechanisms for Scalable Negotiations

  • Chapter
  • First Online:

  • 1707 Accesses

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

Abstract

This paper focuses on enabling the use of negotiation for complex system optimisation, which main challenge nowadays is scalability. Our hypothesis is that analysing the underlying network structure of these systems can help divide the problems in subproblems which facilitate distributed decision making through negotiation in these domains. In this paper, we verify this hypothesis with an extensive set of scenarios for a proof-of-concept problem. After selecting a set of network metrics for analysis, we cluster the scenarios according to these metrics and evaluate a set of mediation mechanisms in each cluster. The validation experiments show that the relative performance of the different mediation mechanisms change for each cluster, which confirms that network-based metrics may be useful for mechanism selection in complex networks.

This is a preview of subscription content, log in via an institution.

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

Learn about institutional subscriptions

References

  1. M. Bichler, An experimental analysis of multi-attribute auctions. Decis. Support Syst. 29(3), 249–268 (2000)

    Article  Google Scholar 

  2. V.D. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre, Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P10008 (2008)

    Article  Google Scholar 

  3. A. Chechetka, K. Sycara, No-commitment branch and bound search for distributed constraint optimization, in Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems (ACM, 2006), pp. 1427–1429

    Google Scholar 

  4. E. de Oliveira, J.M. Fonseca, A. Steiger-Garção, Multi-criteria negotiation on multi-agent systems, in Proceedings of the CEEMAS’99 (1999), p. 190

    Google Scholar 

  5. B. de Wilde, A.W. ter Mors, C. Witteveen, Push and rotate: cooperative multi-agent path planning, in Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems (International Foundation for Autonomous Agents and Multiagent Systems, 2013), pp. 87–94

    Google Scholar 

  6. M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96, 226–231 (1996)

    Google Scholar 

  7. S. Fatima, M. Wooldridge, N.R. Jennings, Optimal negotiation of multiple issues in incomplete information settings, in Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 3 (IEEE Computer Society, 2004), pp. 1080–1087

    Google Scholar 

  8. T.M. Fruchterman, E.M. Reingold, Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11):1129–1164 (1991)

    Google Scholar 

  9. N. Gatti, F. Amigoni, A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes, in Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems (ACM, 2005), pp. 1213–1214

    Google Scholar 

  10. O. Goldreich, Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle is NP-Hard (Springer, Heidelberg, 2011)

    Google Scholar 

  11. K. Hindriks, C. Jonker, D. Tykhonov, Avoiding approximation errors in multi-issue negotiation with issue dependencies, in Proceedings of the 1st International Workshop on Agent-based Complex Automated Negotiations (ACAN 2008) (Citeseer, 2008), pp. 1347–1352

    Google Scholar 

  12. J. Kalagnanam, D.C. Parkes, Auctions, bidding and exchange design, in Handbook of Quantitative Supply Chain Analysis (Springer, New York, 2004), pp. 143–212.

    Google Scholar 

  13. R. Kinney, P. Crucitti, R. Albert, V. Latora, Modeling cascading failures in the North American power grid. Eur. Phys. J. B-Condens. Matter Complex Syst. 46(1), 101–107 (2005)

    Article  Google Scholar 

  14. M. Klein, P. Faratin, H. Sayama, Y. Bar-Yam, Negotiating complex contracts. Group Decis. Negot. 12(2), 111–125 (2003)

    Article  MATH  Google Scholar 

  15. D. Kornhauser, G. Miller, P. Spirakis, in Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications (IEEE, 1984)

    Google Scholar 

  16. M. Li, Q.B. Vo, R. Kowalczyk, Searching for fair joint gains in agent-based negotiation, in Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, vol. 2 (International Foundation for Autonomous Agents and Multiagent Systems, 2009), pp. 1049–1056

    Google Scholar 

  17. I. Marsa-Maestre, M. Klein, C.M. Jonker, R. Aydoğan, From problems to protocols: towards a negotiation handbook. Decis.Support Syst. 60, 39–54 (2014)

    Article  Google Scholar 

  18. P.J. Modi, W.-M. Shen, M. Tambe, M. Yokoo, Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(1), 149–180 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. M. Newman, Networks: An Introduction (Oxford University Press, Oxford, 2010)

    Google Scholar 

  20. M.E. Newman, D.J. Watts, S.H. Strogatz, Random graph models of social networks. Proc. Natl. Acad. Sci. 99(suppl 1), 2566–2572 (2002)

    Article  MATH  Google Scholar 

  21. C. Osorio, M. Bierlaire, Mitigating network congestion: analytical models, optimization methods and their applications, in 90th Annual Meeting, number EPFL-TALK-196049 (2011)

    Google Scholar 

  22. G. Palla, I. Derényi, I. Farkas, T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)

    Article  Google Scholar 

  23. M. Pelikan, K. Sastry, D.E. Goldberg, Multiobjective estimation of distribution algorithms, in Scalable Optimization via Probabilistic Modeling, (Springer, Berlin, 2006), pp. 223–248

    Google Scholar 

  24. E. Ravasz, A.-L. Barabási, Hierarchical organization in complex networks. Phys. Rev. E 67(2), 026112 (2003)

    Article  MATH  Google Scholar 

  25. F. Ren, M. Zhang, Bilateral single-issue negotiation model considering nonlinear utility and time constraint. Decis. Support Syst. 60, 29–38 (2014)

    Article  Google Scholar 

  26. Y. Sakurai, M. Yokoo, K. Kamei, An efficient approximate algorithm for winner determination in combinatorial auctions, in Proceedings of the 2nd ACM Conference on Electronic Commerce (ACM, 2000), pp. 30–37.

    Google Scholar 

  27. B. Schaller, New York citys congestion pricing experience and implications for road pricing acceptance in the united states. Transp. Policy 17(4), 266–273 (2010)

    Article  Google Scholar 

  28. S.H. Strogatz, Exploring complex networks. Nature 410(6825), 268–276 (2001)

    Article  Google Scholar 

  29. P. Surynek, An optimization variant of multi-robot path planning is intractable, in Proceedings of the AAAI (2010)

    Google Scholar 

  30. P. Van Mieghem, H. Wang, X. Ge, S. Tang, F. Kuipers, Influence of assortativity and degree-preserving rewiring on the spectra of networks. Eur. Phys. J. B 76(4), 643–652 (2010)

    Article  MATH  Google Scholar 

  31. M. Vega, Aplicacin de teora de grafos a redes con elementos autnomos. Master’s thesis, University of Alcala, Spain (2014). (In Spanish)

    Google Scholar 

  32. P. Vytelingum, S.D. Ramchurn, T.D. Voice, A. Rogers, N.R. Jennings, Trading agents for the smart electricity grid, in Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol. 1 (International Foundation for Autonomous Agents and Multiagent Systems, 2010), pp. 897–904

    Google Scholar 

  33. H. Wang, S. Liao, L. Liao, Modeling constraint-based negotiating agents. Decis. Support Syst. 33(2), 201–217 (2002)

    Article  Google Scholar 

  34. H. Wiener, Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69(1), 17–20 (1947)

    Article  Google Scholar 

  35. M. Xia, J. Stallaert, A.B. Whinston, Solving the combinatorial double auction problem. Eur. J. Oper. Res. 164(1), 239–251 (2005)

    Article  MATH  Google Scholar 

  36. X. Zhang, R.M. Podorozhny, V.R. Lesser, Cooperative, multistep negotiation over a multi-dimensional utility function, Artificial Intelligence and Soft Computing (Springer, Berlin, 2000), pp. 136–142

    Google Scholar 

Download references

Acknowledgements

This research has been partially supported by two research grants from the Spanish Ministry of Economy and Competitiveness (grants TEC2013-45183-R and TIN2014-61627-EXP).

Author information

Authors and Affiliations

  1. University of Alcala, Madrid, Spain

    Ivan Marsa-Maestre & Enrique de la Hoz

  2. Technical University of Delft, Delft, The Netherlands

    Catholijn M. Jonker

  3. Massachusetts Institute of Technology, Cambridge, Massachusetts, USA

    Mark Klein

Authors
  1. Ivan Marsa-Maestre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catholijn M. Jonker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Enrique de la Hoz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Marsa-Maestre .

Editor information

Editors and Affiliations

  1. Tokyo University of Agriculture and Technology, Tokyo, Japan

    Katsuhide Fujita

  2. School of Engineering, Computer and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand

    Quan Bai

  3. School of Techno-Business Administration, Nagoya Institute of Technology, Nagoya, Japan

    Takayuki Ito

  4. School of Computing and Information Technology, University of Wollongong, Wollongong, New South Wales, Australia

    Minjie Zhang

  5. School of Computing and Information Technology, University of Wollongong, Wollongong, New South Wales, Australia

    Fenghui Ren

  6. Ozyegin University, Istanbul, The Netherlands

    Reyhan Aydoğan

  7. Department of Computer Science and Engineering, Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan

    Rafik Hadfi

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Marsa-Maestre, I., Jonker, C.M., Klein, M., de la Hoz, E. (2017). Using Graph Properties and Clustering Techniques to Select Division Mechanisms for Scalable Negotiations. In: Fujita, K., et al. Modern Approaches to Agent-based Complex Automated Negotiation. Studies in Computational Intelligence, vol 674. Springer, Cham. https://doi.org/10.1007/978-3-319-51563-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51563-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51561-8

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation