39 citations · 255 across the 76 of their papers we have counts for
1 paper · 1 filter
Nathanaël Fijalkow, Paweł Gawrychowski, Pierre Ohlmann
We study the computational complexity of solving mean payoff games. This class of games can be seen as an extension of parity games, and they have similar complexity status: in bot…