The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q383730 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Salil P. Vadhan / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127451547 / rank | |||
Normal rank | |||
Latest revision as of 14:33, 19 March 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
