Imperfect Recall and Counter Games
Dietmar Berwanger, Simon Robert Leßenich, Łukasz Kaiser · 2011
Abstract. We study a class of ω-regular games with imperfect information and imperfect recall, for which we present an automata-based solution method. Furthermore, we show a reduction from a class of counter parity games to games with this kind of imperfect recall. By combining the two results, we obtain an elementary algorithm for solving counter parity games, which leads to improved complexity bounds for model checking quantitative variants of the µ-calculus. 1