Abstract
Stochastic Games are known to be both in the complexity classes P and NP, but no provably efficietn algorithm is known. We present an approach using bisimulations which can lead to a speed-up under certain circumstances.