Finding a Nash equilibrium in spatial games is an NP-complete problem (Q1424226)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Nash equilibrium in spatial games is an NP-complete problem |
scientific article |
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
