Determining whether an additively separable hedonic game admits a strongly popular partition is PCW-complete.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complexity of Strong Popularity in Additively Separable Hedonic Games
Determining whether an additively separable hedonic game admits a strongly popular partition is PCW-complete.