Advertisement

Local Search Algorithms for Core Checking in Hedonic Coalition Games

  • Helena Keinänen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5796)

Abstract

Hedonic games have emerged as an important tool in economics and show promise as a useful formalism to model multi-agent coalition formation in AI as well as group formation in social networks. We consider a coNP-complete problem of core membership checking in hedonic coalition formation games. No previous algorithms to tackle the problem have been presented. In this work, we overcome this by developing two stochastic local search algorithms for core membership checking in hedonic games. We demonstrate the usefulness of the algorithms by showing experimentally that they find solutions efficiently, particularly for large agent societies.

Keywords

multi-agent systems game theory core 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Sung, S.C., Dimitrov, D.: On core membership testing for hedonic coalition formation games. Operations Research Letters 35, 155–158 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Conitzer, V., Sandholm, T.: Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence 170, 607–619 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Malizia, E., Palopoli, L., Scarcello, F.: Infeasibility certificates and the complexity of the core in coalitional games. In: IJCAI, pp. 1402–1407 (2007)Google Scholar
  4. 4.
    Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: Computational complexity of weighted threshold games. In: Proc. of the 22nd National Conf. on Artificial Intelligence, pp. 718–723. AAAI Press, Menlo Park (2007)Google Scholar
  5. 5.
    Elkind, E., Chalkiadakis, G., Jennings, N.R.: Coalition structures in weighted voting games. In: Proc. of the 18th European Conf. on Artificial Intelligence, pp. 393–397. IOS Press, Amsterdam (2008)Google Scholar
  6. 6.
    Drèze, J.H., Greenberg, J.: Hedonic optimality and stability. Econometrica 4, 987–1003 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Ballester, C.: Np-completeness in hedonic games. Games and Economic Behavior 49, 1–30 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Alcalde, J., Romero-Medina, A.: Coalition formation and stability. Social Choice and Welfare 27, 365–375 (2006)CrossRefzbMATHGoogle Scholar
  9. 9.
    Banerjee, S., Konishi, H., Sonmez, T.: Core in a simple coalition formation game. Social Choice and Welfare 18, 135–153 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games and Economic Behavior 38, 201–230 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Iehlé, V.: The core partition of hedonic games. Mathematical Social Sciences 54, 176–185 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: Proc. of 8th Int. Conf. on Autonomous Agents and Multiagent Systems, AAMAS 2009 (2009)Google Scholar
  13. 13.
    Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)CrossRefGoogle Scholar
  14. 14.
    Kernighan, B.W., Ritchie, D.M.: The C Programming Language. Prentice Hall, Englewood Cliffs (1988)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Helena Keinänen
    • 1
  1. 1.Faculty of Information and Natural SciencesHelsinki University of TechnologyFinland

Personalised recommendations