Sciweavers

CORR
2010
Springer

Optimal Partitions in Additively Separable Hedonic Games

13 years 3 months ago
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partition with maximum egalitarian or utilitarian social welfare is NP-hard in the strong sense whereas a Pareto optimal partition can be computed in polynomial time when preferences are strict. Perhaps surprisingly, checking whether a given partition is Pareto optimal is coNP-complete in the strong sense, even when preferences are symmetric and strict. We also show that checking whether there exists a partition which is both Pareto optimal and envy-free is p 2-complete. Furthermore, checking whether there exists a partition which is both envy-free and Nash stable is NP-complete when preferences are symmetric.
Haris Aziz, Felix Brandt, Hans Georg Seedig
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Haris Aziz, Felix Brandt, Hans Georg Seedig
Comments (0)