The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:16, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computational Complexity of Nash Equilibria in Concisely Represented Games |
scientific article |
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
