A Perfect-Information Construction for Coordination in Games

Authors Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala

Thumbnail PDF


  • Filesize: 437 kB
  • 12 pages

Document Identifiers

Author Details

Dietmar Berwanger
Lukasz Kaiser
Bernd Puchala

Cite AsGet BibTex

Dietmar Berwanger, Lukasz Kaiser, and Bernd Puchala. A Perfect-Information Construction for Coordination in Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 387-398, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


We present a general construction for eliminating imperfect information from games with several players who coordinate against nature, and to transform them into two-player games with perfect information while preserving winning strategy profiles. The construction yields an infinite game tree with epistemic models associated to nodes. To obtain a more succinct representation, we define an abstraction based on homomorphic equivalence, which we prove to be sound for games with observable winning conditions. The abstraction generates finite game graphs in several relevant cases, and leads to a new semi-decision procedure for multi-player games with imperfect information.
  • Distributed Synthesis
  • Games on Graphs
  • Imperfect Information
  • Epistemic Models


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail