Logo Logo
Help
Contact
Switch Language to German

Sung, Shao-Chin and Dimitrov, Dinko (7. October 2008): Computational Complexity in Additive Hedonic Games. Discussion Papers in Economics 2008-18 [PDF, 191kB]

Abstract

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. Furthermore, the corresponding decision problems with respect to the existence of a Nash stable coalition structure and of an individually stable coalition structure turn out to be NP-complete in the strong sense.

Actions (login required)

View Item View Item