The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564)
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: The Computational Complexity of Nash Equilibria in Concisely Represented Games |
scientific article; zbMATH DE number 6485174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Computational Complexity of Nash Equilibria in Concisely Represented Games |
scientific article; zbMATH DE number 6485174 |
Statements
The Computational Complexity of Nash Equilibria in Concisely Represented Games (English)
0 references
24 September 2015
0 references
Nash equilibrium
0 references
circuit games
0 references
computational game theory
0 references
concise games
0 references
graph games
0 references
0.94837046
0 references
0.94837046
0 references
0.9431766
0 references
0.9414561
0 references
0.9411609
0 references
0.9394953
0 references
0.9394953
0 references
0.9392151
0 references
0.93437827
0 references
