8 citations · 39 across the 15 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2017
Parity Games, Imperfect Information and Structural Complexity
Bernd Puchala, Roman Rabinovich
We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with pe…
cs.GT2011★ 3 cited
Graph Searching, Parity Games and Imperfect Information
Bernd Puchala, Roman Rabinovich
We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect informati…