Strategy improvement and randomized subexponential algorithms for stochastic parity games

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

Volumn 3884 LNCS, Issue , 2006, Pages 512-523

  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

ALGORITHMS; COMPUTER SCIENCE; GAME THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

GAME GRAPH; NON-BRUTE-FORCE ALGORITHM; PARITY GAMES; PROBABILISTIC TRANSITIONS;

GRAPH THEORY;

EID: 33745587756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_42     Document Type: Conference Paper

References (12)

1. H. Bjorklund, S. Sandberg, and S. Vorobyov. A discrete subexponential algorithm for parity games. In STACS, pages 663-674. LNCS 2607, Springer, 2003.
2. K. Chatterjee, L. de Alfaro, and T.A. Henzinger. The complexity of stochastic Rabin and Streett games. In ICALP, pages 878-890. LNCS 3580, Springer, 2005.
3. K. Chatterjee, M. Jurdziriski, and T. A. Henzinger. Simple stochastic parity games. In CSL, pages 100-113. LNCS 2803, Springer, 2003.
4. K. Chatterjee, M. Jurdziriski, and T.A. Henzinger. Quantitative stochastic parity games. In SODA, pages 114-123. SIAM, 2004.
5. A. Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
6. A. Condon. On algorithms for simple stochastic games. In Advances in Computational Complexity Theory, pages 51-73. American Mathematical Society, 1993.
7. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In FOCS, pages 328-337. IEEE Computer Society Press, 1988.
8. A. Huffman and R. Karp. On nonterminating stochastic games. Management Science, 12:359-370, 1966.
9. M. Jurdziriski, M. Paterson, and U. Zwick. A deterministic subexponential algorithm for solving parity games. In SODA (To appear), 2006.
10. W. Ludwig. A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation, 117:151-155, 1995.
11. W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages, volume 3, Beyond Words, chapter 7, pages 389-455. Springer, 1997.
12. J. Vöge and M. Jurdziriski. A discrete strategy improvement algorithm for solving parity games. In CAV, pages 202-215. LNCS 1855, Springer, 2000.