Logarithmic query complexity for approximate Nash computation in large games (Q1733380)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logarithmic query complexity for approximate Nash computation in large games |
scientific article |
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
