A sublinear-time randomized approximation algorithm for matrix games
type: Item
instance of: scholarly article
title: A sublinear-time randomized approximation algorithm for matrix games
zbMATH Open document ID: 0857.90144
DOI: 10.1016/0167-6377(95)00032-0
author: M. D. Grigoriadis
author: Leonid G. Khachiyan
published in: Operations Research Letters
publication date: 1997-03-11T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 912512
zbMATH Keywords: approximation algorithms
zbMATH Keywords: parallel randomized algorithm
zbMATH Keywords: \(\varepsilon\)-optimal strategies
zbMATH Keywords: \((m, n)\)-matrix game
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00032-0
OpenAlex ID: W2053924317
cites work: Q5808755
cites work: Q3844775
cites work: Q4323609
cites work: Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
cites work: Convergence rate of the game processes for solving matrix games
cites work: Simple strategies for large zero-sum games with applications to complexity theory
cites work: A parallel approximation algorithm for positive linear programming
cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems
cites work: An iterative method of solving a game
cites work: Note on a computation method in the theory of games
description: scientific article; zbMATH DE number 912512