On the power of imperfect information

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 2, Issue , 2008, Pages 73-82

  Berwanger, Dietmar ^a   Doyen, Laurent ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b EPFL   (Switzerland)

Author keywords

Imperfect information; Infinite games

Indexed keywords

BLOW-UP; IMPERFECT INFORMATION; INFINITE GAME; INFORMATION GAME; PARITY GAMES; PERFECT INFORMATIONS; POLYNOMIAL-TIME REDUCTION; SAFETY CONDITION;

SOFTWARE ENGINEERING;

SECURITY OF DATA;

EID: 80052904648     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. ARNOLD, The μ-calculus alternation-depth is strict on binary trees, Inf. Théorique et Applications, 33 (1999), pp. 329-339.
2. E. BACH and J. SHALLIT, Algorithmic Number Theory, Vol. 1: Efficient Algorithms, MIT Press, 1996.
3. J. BERNET, D. JANIN, and I. WALUKIEWICZ, Permissive strategies: from parity games to safety games, Inf. Théorique et Applications, 36 (2002), pp. 261-275.
4. J. BRADFIELD, The modal μ-calculus alternation hierarchy is strict, Theoretical Computer Science, 195 (1998), pp. 133-153.
5. K. CHATTERJEE, L. DOYEN, T. A. HENZINGER, and J.-F. RASKIN, Algorithms for omega-regular games of incomplete information, Logical Methods in Computer Science, 3 (2007).
6. E. A. EMERSON and C. S. JUTLA, Tree automata, mu-calculus and determinacy, in Proc. of FoCS 1991, IEEE, 1991, pp. 368-377.
7. E. GRÄDEL, W. THOMAS, AND T. WILKE, eds., Automata, Logics, and Infinite Games, LNCS 2500, Springer-Verlag, 2002.
8. M. JURDZIŃSKI, Deciding the winner in parity games is in UP ∩ co-UP, Information Processing Letters, 68 (1998), pp. 119-124.
9. M. JURDZIŃ SKI, Small progress measures for solving parity games, in Proc. of STACS: Theor. Aspects of Comp. Sc., LNCS 1770, Springer, 2000, pp. 290-301.
10. M. JURDZIŃSKI, M. PATERSON, AND U. ZWICK, A deterministic subexponential algorithm for solving parity games, in Proc. of SODA: Symp. on Discrete Algorithms, ACM Press, 2006, pp. 117-123.
11. G. LENZI, A hierarchy theorem for the mu-calculus, in Proc. of ICALP: Automata, Languages and Programming, LNCS 1099, Springer, 1996, pp. 87-97.
12. D. NIWINSKI and H. SEIDL, On distributive fixed-point expressions, Inf. Théorique et Applications, 33 (1999), pp. 427-446.
13. J. REIF, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, 29 (1984), pp. 274-301.
14. S. SCHEWE, Solving parity games in big steps, in Proc. of FSTTCS: Foundations of Software Tech. and Theor. Comp. Sc., LNCS 4855, Springer, 2007, pp. 449-460.
15. H. SEIDL, Fast and simple nested fixpoints, Information Processing Letters, 59 (1996), pp. 303-308.
16. W. THOMAS, Languages, automata, and logic, Handbook of Formal Languages, 3 (1997), pp. 389-455.