Random bimatrix games are asymptotically easy to solve (a simple proof) (Q3095273)
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: Random bimatrix games are asymptotically easy to solve (a simple proof) |
scientific article; zbMATH DE number 5965654
| 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 5965654 |
Statements
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) (English)
0 references
28 October 2011
0 references
0.9984737038612366
0 references
0.85875004529953
0 references
0.8469374775886536
0 references
0.8468339443206787
0 references
0.8375119566917419
0 references
