Nash Stability in Additively Separable Hedonic Games Is NP-Hard

DOI10.1007/978-3-540-73001-9_62zbMath1151.91346OpenAlexW1536706626MaRDI QIDQ5425362

Martin Olsen

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_62

zbMATH Keywords

Hedonic GamesNash StabilityNP-Completeness

Mathematics Subject Classification ID

Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A social choice approach to ordinal group activity selection ⋮ Stable and Pareto optimal group activity selection from ordinal preferences ⋮ Computational complexity in additive hedonic games

This page was built for publication: Nash Stability in Additively Separable Hedonic Games Is NP-Hard