Local Search Algorithms for Core Checking in Hedonic Coalition Games

Authors:
Helena Keinänen
Affiliations:
Faculty of Information and Natural Sciences, Helsinki University of Technology,
Venue:
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Year:
2009

Citing 7
Cited 0

The C programming language

The C programming language
Hedonic coalition nets

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Coalition Structures in Weighted Voting Games

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Computational complexity of weighted threshold games

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Infeasibility certificates and the complexity of the core in coalitional games

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Complexity of constructing solutions in the core based on synergies among coalitions

Artificial Intelligence
On core membership testing for hedonic coalition formation games

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.