It is shown that the parity game can be solved in quasipolynomial time. The parameterised
parity game-with n nodes and m distinct values (aka colours or priorities)-is proven to be in …

The Handbook of Linear Algebra provides comprehensive coverage of linear algebra
concepts, applications, and computational software packages in an easy-to-use handbook …

Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

Ye [2011] showed recently that the simplex method with Dantzig's pivoting rule, as well as
Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs) …

We show that several decision problems originating from max-plus or tropical convexity are
equivalent to zero-sum two player game problems. In particular, we set up an equivalence …

We present a new quasi-polynomial algorithm for solving parity games. It is based on a new
bisimulation invariant measure of complexity for parity games, called the register-index …

Stochastic games provide a versatile model for reactive systems that are affected by random
events. This dissertation advances the algorithmic theory of stochastic games to incorporate …

Several distinct techniques have been proposed to design quasi-polynomial algorithms for
solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and …

The simplex algorithm is among the most widely used algorithms for solving linear programs
in practice. With essentially all deterministic pivoting rules it is known, however, to require an …

We prove that the simplex method with the highest gain/most-negative-reduced cost pivoting
rule converges in strongly polynomial time for deterministic Markov decision processes …