Semiperfect-information games

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

Volumn 3821 LNCS, Issue , 2005, Pages 1-18

  Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONTROL EQUIPMENT; GAME THEORY; INFORMATION ANALYSIS; INFORMATION TECHNOLOGY;

REACTIVE SYSTEMS; SEMIPERFECT INFORMATION; TURN-BASED GAMES;

ARTIFICIAL INTELLIGENCE;

EID: 33744918791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_1     Document Type: Conference Paper

References (20)

1. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49:672-713, 2002.
2. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the AMS, 138:295-311, 1969.
3. K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of quantitative concurrent parity games. In SODA 06. ACM Press, 2006.
4. K. Chatterjee, R.Majumdar, and M. Jurdziński. On Nash equilibria in stochastic games. In CSL 04, volume 3210 of LNCS, pages 26-40. Springer, 2004.
5. L. de Alfaro and T.A. Henzinger. Concurrent omega-regular games. In LICS 00, pages 141-154. IEEE Computer Society Press, 2000.
6. L. de Alfaro and T.A. Henzinger. Interface theories for component-based design. In EMSOFT 01, volume 2211 of LNCS, pages 148-165. Springer, 2001.
7. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In FOCS 98, pages 564-575. IEEE Computer Society Press, 1998.
8. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. In STOC 01, pages 675-683. ACM Press, 2001.
9. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In FOCS 88, pages 328-337. IEEE Computer Society Press, 1988.
10. E.A. Emerson and C. Jutla. Tree automata, mu-calculus, and determinacy. In FOCS 91, pages 368-377. IEEE Computer Society Press, 1991.
11. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. Information and Computation, 173:64-81, 2002.
12. M. Jurdzinski. Small progress measures for solving parity games. In STACS 00, volume 1770 of LNCS, pages 290-301. Springer, 2000.
13. D.A. Martin. Borel determinacy. Annals of Mathematics, 102:363-371, 1975.
14. D.A. Martin. The determinacy of Blackwell games. The Journal of Symbolic Logic, 63:1565-1581, 1998.
15. R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149-184, 1993.
16. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL 89, pages 179-190. ACM Press, 1989.
17. P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization, 25:206-230, 1987.
18. J.H. Reif. Universal games of incomplete information. In STOC 79, pages 288-308. ACM Press, 1979.
19. W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages, volume 3, chapter 7, pages 389-455. Springer, 1997.
20. J. Vöge and M. Jurdziński. A discrete strategy improvement algorithm for solving parity games. In CAV 00, volume 1855 of LNCS, pages 202-215. Springer, 2000.