Finding a Nash equilibrium in spatial games is an NP-complete problem (Q1424226)
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: Finding a Nash equilibrium in spatial games is an NP-complete problem |
scientific article; zbMATH DE number 2055119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Nash equilibrium in spatial games is an NP-complete problem |
scientific article; zbMATH DE number 2055119 |
Statements
Finding a Nash equilibrium in spatial games is an NP-complete problem (English)
0 references
11 March 2004
0 references
Spatial games
0 references
NP-completeness
0 references
Graph \(k\)-colorability.
0 references
0.86683935
0 references
0.86168677
0 references
0.8606341
0 references
0.8541285
0 references
0.85345864
0 references
0.8522933
0 references
0.8511486
0 references
