---
res:
  bibo_abstract:
  - 'We 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. In this paper, we build on the antichain approach to develop an algorithm
    for constructing the winning strategies in parity games of imperfect information.
    One major obstacle in adapting the classical procedure is that the complementation
    of attractor sets would break the invariant of downward-closedness on which the
    antichain representation relies. We overcome this difficulty by decomposing problem
    instances recursively into games with a combination of reachability, safety, and
    simpler parity conditions. We also report on an experimental implementation of
    our algorithm: to our knowledge, this is the first implementation of a procedure
    for solving imperfect-information parity games on graphs.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Dietmar
      foaf_name: Berwanger, Dietmar
      foaf_surname: Berwanger
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Martin
      foaf_name: De Wulf, Martin
      foaf_surname: De Wulf
  - foaf_Person:
      foaf_givenName: Laurent
      foaf_name: Doyen, Laurent
      foaf_surname: Doyen
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  bibo_doi: 10.1016/j.ic.2009.09.006
  bibo_issue: '10'
  bibo_volume: 208
  dct_date: 2010^xs_gYear
  dct_identifier:
  - UT:000281830300007
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Strategy construction for parity games with imperfect information@
...