Calude et al. have recently shown that parity games can be solved in quasi-polynomial time,
a landmark result that has led to several approaches with quasi-polynomial complexity …

We develop an algorithm that combines the advantages of Priority Promotion, that is one of
the leading approaches to solving large parity games in practice, with the quasi-polynomial …

Symmetry is inherent in the definition of most of the two-player zero-sum games, including
parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no …

I vividly recall the moment, somewhere in February 2009, when Jan Friso Groote walked into
my office. We had discussed my ambition for doing scientific research before, and he offered …

Parity games are simple infinite games played on finite graphs with a winning condition that
is expressive enough to capture nested least and greatest fixpoints. Through their tight …

Symmetric strategy improvement is an algorithm introduced by Schewe et al.(ICALP 2015)
that can be used to solve two-player games on directed graphs such as parity games and …

Abstract The McNaughton-Zielonka divide et impera algorithm is the simplest and most
flexible approach available in the literature for determining the winner in a parity game …

The low interest of students in social studies subjects is possible because the teacher's
efforts have not been optimal to increase the creative thinking of students' learning. Students' …

A parity game is a game played by two players on the nodes of a directed graph. Solving a
parity game consists of finding out who can win and what the winning strategy is. Solving …