A discrete strategy improvement algorithm for solving parity games

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

Volumn 1855, Issue , 2000, Pages 202-215

  Vöge, Jens ^a   Jurdziński, Marcin ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER AIDED ANALYSIS; LINEAR PROGRAMMING; MODEL CHECKING; POLYNOMIAL APPROXIMATION; STOCHASTIC SYSTEMS; TEMPORAL LOGIC;

ALGORITHM FOR SOLVING; CONCEPTUAL UNDERSTANDING; DISCOUNTED PAYOFF GAMES; EFFICIENT IMPLEMENTATION; MODAL MU CALCULUS; MODEL CHECKING PROBLEM; STANDING PROBLEMS; WINNING STRATEGY;

GAME THEORY;

EID: 84944395659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_18     Document Type: Conference Paper

References (21)

1. A. Browne, E. M. Clarke, S. Jha, D. E. Long, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. Theoretical Computer Science, 178(1-2):237-255, May 1997.
2. Nils Buhrke, Helmut Lescow, and Jens Vöge. Strategy construction in in finite games with Streett and Rabin chain winning conditions. In Tiziana Margaria and Bernhard Steffen, editors, Tools and Algorithms for Construction and Analysis of Systems, Second International Workshop, TACAS '96, Proceedings, volume 1055 of Lecture Notes in Computer Science, pages 207-224, Passau, Germany, 27-29 March 1996. Springer
3. Anne Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
4. Anne Condon. On algorithms for simple stochastic games. In Jin-Yi Cai, editor, Advances in Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 51-73. American Mathematical Society, 1993.
5. A. Ehrenfeucht and J. Mycielski. Positional strategies for mean payoff games. Int. Journal of Game Theory, 8(2):109-113, 1979.
6. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (Extended abstract). In Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pages 368-377. IEEE Computer Society Press, 1991.
7. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of μ-calculus. In Costas Courcoubetis, editor, Computer Aided Verification, 5th International Conference, CAV'93, volume 697 of LNCS, pages 385-396, Elounda, Greece, June/July 1993. Springer-Verlag.
8. A. Hoffman and R. Karp. On nonterminating stochastic games. Management Science, 12:359-370, 1966.
9. Marcin Jurdziński. Deciding the winner in parity games is in UP\co-UP. Information Processing Letters, 68(3):119-124, November 1998.
10. Marcin Jurdziński. Small progress measures for solving parity games. In Horst Reichel and Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, volume 1770 of Lecture Notes in Computer Science, pages 290-301, Lille, France, February 2000. Springer.
11. Robert McNaughton. In finite games played on finite graphs. Annals of Pure and Applied Logic, 65(2):149-184, 1993.
12. Nimrod Megiddo. Towards a genuinely polynomial algorithm for linear programming. SIAM Journal on Computing, 12:347-353, 1983.
13. Mary Melekopoglou and Anne Condon. On the complexity of the policy improvement algorithm for stochastic games. ORSA (Op. Res. Soc. of America) Journal of Computing, 6(2):188-192, 1994.
14. A. W. Mostowski. Games with forbidden positions. Technical Report 78, University of Gdańsk, 1991.
15. Anuj Puri. Theory of Hybrid Systems and Discrete Event Systems. PhD thesis, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, December 1995. Memorandum No. UCB/ERL M95/113.
16. Dominik Schmitz and Jens Vöge. Implementation of a strategy improvement algorithm for finite-state parity games. manuscipt, unpublished, April 2000.
17. Helmut Seidl. Fast and simple nested fixpoints. Information Processing Letters, 59(6):303-308, September 1996.
18. Colin Stirling. Local model checking games (Extended abstract). In Insup Lee and Scott A. Smolka, editors, CONCUR'95: Concurrency Theory, 6th International Conference, volume 962 of LNCS, pages 1-11. Springer-Verlag, 1995.
19. Jens Vöge and Marcin Jurdziński. A discrete strategy improvement algorithm for solving parity games. Aachener Informatik-Berichte 2000-2, RWTH Aachen, Fachgruppe Informatik, 52056 Aachen, Germany, February 2000.
20. Wies law Zielonka. In finite games on finitely coloured graphs with applications to automata on in finite trees. Theoretical Computer Science, 200:135-183, 1998.
21. Uri Zwick and Mike Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158:343-359, 1996.