On sparse approximations to randomized strategies and convex combinations
type: Item
instance of: scholarly article
title: On sparse approximations to randomized strategies and convex combinations
zbMATH Open document ID: 0801.90074
DOI: 10.1016/0024-3795(94)90357-3
author: Ingo Althöfer
published in: Linear Algebra and its Applications
publication date: 1994-05-09T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 566106
zbMATH Keywords: approximation lemma
zbMATH Keywords: matrix games
zbMATH Keywords: computer chess
zbMATH Keywords: uniform sampling spaces
MaRDI profile type: Publication
full work available at URL: 0024-3795(94)90357-3
OpenAlex ID: W2032716871
cites work: Q4004178
cites work: Elimination of correlation in random codes for arbitrarily varying channels
cites work: Q4191951
cites work: Q4004078
cites work: ``Integer-making'' theorems
cites work: Q4023085
cites work: Elimination of Randomization in Certain Statistical Decision Procedures and Zero-Sum Two-Person Games
cites work: Q4065548
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Monte-Carlo approximation algorithms for enumeration problems
cites work: Discrepancy of set-systems and matrices
cites work: On deterministic approximation of DNF
cites work: Q3496342
cites work: Q3916401
cites work: Q5802493
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: Two methods of randomization in statistics and the theory of games
description: scientific article; zbMATH DE number 566106