How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57567488, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57567488 / rank | |||
Normal rank | |||
Latest revision as of 01:24, 28 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How Hard Is It to Approximate the Best Nash Equilibrium? |
scientific article |
Statements
How Hard Is It to Approximate the Best Nash Equilibrium? (English)
0 references
17 May 2011
0 references
polynomial-time approximation scheme
0 references
Nash equilibrium
0 references
two-player game
0 references
algorithmic game theory
0 references
approximate equilibrium
0 references
clique
0 references
random graph
0 references
