Algorithmic analysis of parity games

We consider an application of stationary balance searching algorithm in cyclic games [1] for solving parity games. Algorithm is presented with it's exponential complexity estimation, and we provide an example of parity game structure, for which this complexity is reached. Parity games are known to be in NP ∩ co-NP, and no polynomial algorithm is known for them.