Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...