Strategy construction for parity games with imperfect information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5201 LNCS, Issue , 2008, Pages 325-339

  Berwanger, Dietmar ^a   Chatterjee, Krishnendu ^b   Doyen, Laurent ^c   Henzinger, Thomas A ^c,d   Raje, Sangram ^e  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c EPFL   (Switzerland)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

ANTICHAIN; IMPERFECT INFORMATIONS; INFORMATION GAMES; PARITY GAMES; STATE SETS; SUCCINCT REPRESENTATIONS; WINNING STRATEGIES;

GAME THEORY;

EID: 54249155537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_27     Document Type: Conference Paper

References (12)

1. Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T.A., Raje, S.: Strategy construction for parity games with imperfect information. Technical Report MTCREPORT-2008-005, EPFL (2008), http://infoscience.epfl.ch/record/125011
2. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omegaregular games of incomplete information. Logical Methods in Computer Science 3(3:4) (2007)
3. De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17-30. Springer, Heidelberg (2006)
4. De Wulf, M., Doyen, L., Maquet, N., Raskin, J.-F.: Antichains: Alternative algorithms for LTL satisfiability and model-checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 63-77. Springer, Heidelberg (2008)
5. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proc. of FoCS 1991, pp. 368-377. IEEE, Los Alamitos (1991) 6. Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
6. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
7. Henzinger, T.A., Jhala, R., Majumdar, R.: Counterexample-guided control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 886-902. Springer, Heidelberg (2003)
8. McNaughton, R.: Infinite games played on finite graphs. Annals of Pure and Applied Logic 65(2), 149-184 (1993)
9. Reif, J.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences 29, 274-301 (1984)
10. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1-13. Springer, Heidelberg (1995)
11. Thomas, W.: Languages, automata, and logic. Handbook of Formal Languages 3, 389-455 (1997)
12. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 135-183 (1998)