Simulated Annealing for Multi-agent Coalition Formation | SpringerLink
Skip to main content
Springer Nature Link
Log in

Simulated Annealing for Multi-agent Coalition Formation

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2009)

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

  • 1664 Accesses

Abstract

We present a simulated annealing algorithm for coalition formation represented as characteristic function games. We provide a detailed analysis of various neighbourhoods for the algorithm, and of their effects to the algorithm’s performance. Our practical experiments and comparisons with other methods demonstrate that simulated annealing provides a useful tool to tackle the combinatorics involved in multi-agent coalition formation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Černý, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. of Opt. Theory and Applications 45, 41–51 (1985)

    MathSciNet  MATH  Google Scholar 

  2. Dang, V.D., Jennings, N.R.: Generating coalition structures with finite bound from the optimal guarantees. In: Proc. 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems, pp. 546–571 (2004)

    Google Scholar 

  3. Dang, V.D., Jennings, N.R.: Coalition structure generation in task based-settings. In: Proc. 17th ECAI, pp. 210–214 (2006)

    Google Scholar 

  4. Kahan, J.P., Rapoport, A.: Theories of Coalition Formation. Lawrence Erlbaum Associates Publishers, Hillsdale (1984)

    MATH  Google Scholar 

  5. Keinänen, H., Keinänen, M.: Simulated annealing for coalition formation. In: Proc. 18th ECAI, pp. 857–858 (2008)

    Google Scholar 

  6. Kernighan, B.W., Ritchie, D.M.: The C Programming Language. Prentice-Hall, Englewood Cliffs (1988)

    MATH  Google Scholar 

  7. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  8. Larson, K., Sandholm, T.: Anytime coalition structure generation: An average case study. J. Expt. Theor. Artif. Intell. 12, 23–42 (2000)

    MATH  Google Scholar 

  9. Rahwan, T., Ramshurn, S.D., Giovannucci, A., Dang, V.D., Jennings, N.R.: Anytime optimal coalition structure generation. In: Proc. AAAI 2007, pp. 1184–1190 (2007)

    Google Scholar 

  10. Rahwan, T., Jennings, N.R.: Coalition structure generation: dynamic programming meets anytime optimization. In: Proc. AAAI 2008, pp. 156–161 (2008)

    Google Scholar 

  11. Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Coalition structure generation with worst case guarantees. Artificial Intelligence 111, 209–239 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sen, S., Dutta, P.S.: Searching for optimal coalition structures. In: Proc. 4th Int. Conf. on Multi-Agent Systems, pp. 286–292 (2000)

    Google Scholar 

  13. Yang, J., Luo, Z.: Coalition formation mechanism in multi-agent systems based on genetic algorithms. Applied Soft Computing 7, 561–568 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Helsinki University of Technology, Finland

    Helena Keinänen

Authors
  1. Helena Keinänen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Systems Science, Stockholm University, Forum 100, 164 40, Kista, Sweden

    Anne Håkansson

  2. Institute of Informatics, Wroclaw University of Technology, Str. Janiszweskiego 11/17, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  3. Department of Computer Science, Franklin University, 201 South Grant Ave., 43215, Columbus, Ohio, USA

    Ronald L. Hartung

  4. School of Environment and Technology, Centre for SMART Systems, University of Brighton, BN2 4GJ, Brighton, UK

    Robert J. Howlett

  5. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, SA, 5095, Mawson Lakes, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keinänen, H. (2009). Simulated Annealing for Multi-agent Coalition Formation. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2009. Lecture Notes in Computer Science(), vol 5559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01665-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01665-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01664-6

  • Online ISBN: 978-3-642-01665-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics