Logarithmic query complexity for approximate Nash computation in large games (Q1733380)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Logarithmic query complexity for approximate Nash computation in large games |
scientific article; zbMATH DE number 7040091
| 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 7040091 |
Statements
Logarithmic query complexity for approximate Nash computation in large games (English)
0 references
21 March 2019
0 references
game theory
0 references
Lipschitz games
0 references
multi-player games
0 references
uncoupled dynamics
0 references
equilibrium computation
0 references
0 references
0.9940213561058044
0 references
0.8658410310745239
0 references
0.8616280555725098
0 references
0.843879759311676
0 references
0.8364409804344177
0 references
