A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem

We describe a randomized algorithm for the simple stochastic game problem that requires 2 O(√n) expected operations for games with n vertices. This is the first subexponential time algorithm for this problem.

Authors

• W. Ludwig

Keywords

No keywords are indexed for this paper.