NP-completeness in hedonic games (Q1886742)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness in hedonic games |
scientific article; zbMATH DE number 2116807
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness in hedonic games |
scientific article; zbMATH DE number 2116807 |
Statements
NP-completeness in hedonic games (English)
0 references
19 November 2004
0 references
Hedonic games
0 references
Coalition formation
0 references
Computational complexity
0 references
NP-hard
0 references
NP-complete
0 references
0 references
