Berwanger, DietmarChatterjee, KrishnenduDe Wulf, MartinDoyen, LaurentHenzinger, Thomas A.2011-12-162011-12-162011-12-16201010.1016/j.ic.2009.09.006https://infoscience.epfl.ch/handle/20.500.14299/75204WOS:000281830300007We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies.Infinite GamesUniversalityAutomataGraphstext::journal::journal article::research article