Sciweavers

MFCS
2010
Springer
13 years 10 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
MFCS
2010
Springer
13 years 10 months ago
Asynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
Bernd Puchala