Computational complexity in additive hedonic games (Q1046065)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5650806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity in additive hedonic games |
scientific article; zbMATH DE number 5650806 |
Statements
Computational complexity in additive hedonic games (English)
0 references
21 December 2009
0 references
additive preferences
0 references
coalition formation
0 references
computational complexity
0 references
hedonic games
0 references
NP-hard
0 references
NP-complete
0 references
0 references
0.9289144
0 references
0 references
0.89353275
0 references
0.8873246
0 references
0.8842384
0 references
0.88243115
0 references
0.8796326
0 references
0.8796326
0 references
0 references
