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...

Ausführliche Beschreibung