A sublinear-time randomized approximation algorithm for matrix games (Q1919166)
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: A sublinear-time randomized approximation algorithm for matrix games |
scientific article; zbMATH DE number 912512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sublinear-time randomized approximation algorithm for matrix games |
scientific article; zbMATH DE number 912512 |
Statements
A sublinear-time randomized approximation algorithm for matrix games (English)
0 references
11 March 1997
0 references
approximation algorithms
0 references
parallel randomized algorithm
0 references
\(\varepsilon\)-optimal strategies
0 references
\((m, n)\)-matrix game
0 references
0 references
0.7736580967903137
0 references
0.7715325355529785
0 references
0.7673968076705933
0 references
0.7603102326393127
0 references
0.7602847814559937
0 references
