Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443)
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 6630953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logarithmic Query Complexity for Approximate Nash Computation in Large Games |
scientific article; zbMATH DE number 6630953 |
Statements
Logarithmic Query Complexity for Approximate Nash Computation in Large Games (English)
0 references
29 September 2016
0 references
large games
0 references
Nash equilibrium computation
0 references
logarithmic query complexity
0 references
0 references
0.99999964
0 references
0.9421623
0 references
0.9421623
0 references
0.89761275
0 references
0.89761275
0 references
0.89425015
0 references
0.89324135
0 references
