Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770)
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 6803516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random bimatrix games are asymptotically easy to solve (a simple proof) |
scientific article; zbMATH DE number 6803516 |
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
0 references
0 references
0 references
0.86727023
0 references
0.8593588
0 references
0.8556498
0 references
0.85553616
0 references
0.8548596
0 references
