NP-completeness in hedonic games (Q1886742): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.geb.2003.10.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070069359 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness in hedonic games |
scientific article |
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
