Complexity and optimality of the best response algorithm in random potential games (Q2819446)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6630956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and optimality of the best response algorithm in random potential games |
scientific article; zbMATH DE number 6630956 |
Statements
Complexity and Optimality of the Best Response Algorithm in Random Potential Games (English)
0 references
29 September 2016
0 references
finite potential games
0 references
best response algorithm
0 references
pure Nash equilibrium
0 references
0.7936115860939026
0 references
0.7915958166122437
0 references
0.7836470007896423
0 references
0.7706781625747681
0 references
0.75572270154953
0 references
