Finding a Nash equilibrium in spatial games is an NP-complete problem (Q1424226): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011808708 / rank | |||
Normal rank | |||
Latest revision as of 22:25, 19 March 2024
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
