A Lattice Theory for Solving Games of Imperfect Information
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable examples of such systems are timed and hybrid automata. As an application, we show that the discrete control problem for games of imperfect information defined by rectangular automata is decidable. This result extends a result by Henzinger and Kopke in [HK99].
KeywordsControl Problem Incomplete Information Lattice Theory Perfect Information Imperfect Information
Unable to display preview. Download preview PDF.
- [CC77]Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238–252 (1977)Google Scholar
- [DDR06]De Wulf, M., Doyen, L., Raskin, J.-F.: A lattice theory for solving games of imperfect information (extended version). Technical Report 58, U.L.B. – Federated Center in Verification (2006), http://www.ulb.ac.be/di/ssd/cfv/publications.html