A sublinear-time randomized approximation algorithm for matrix games

This paper presents a parallel randomized algorithm which computes a pair of ε-optimal strategies for a given ( m, n)-matrix game A = [ a ij ] ϵ [−1, 1] in O( ε −2log 2( n+ m)) expected time on an ( n+ m)/log( n+ m)-processor EREW PRAM. For any fixed accuracy ϵ > 0, the expected sequential runnin...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research letters Vol. 18; no. 2; pp. 53 - 58
Main Authors:	Grigoriadis, Michael D., Khachiyan, Leonid G.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.09.1995 Elsevier
Subjects:	Applied sciences Approximation algorithms Complexity Exact sciences and technology Game theory Linear programming Matrix games Operational research and scientific management Operational research. Management science Parallel algorithms Randomized algorithms Matrix games Approximation algorithms Linear programming Randomized algorithms Parallel algorithms Complexity Lower bound Algorithms Approximation Deterministic approach Computational complexity Matrix game Game theory
ISSN:	0167-6377, 1872-7468
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!