Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:20, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random bimatrix games are asymptotically easy to solve (a simple proof) |
scientific article |
Statements
Random bimatrix games are asymptotically easy to solve (a simple proof) (English)
0 references
7 November 2017
0 references
approximate Nash equilibrium
0 references
bimatrix game
0 references
random game
0 references
Hoeffding bounds
0 references
