Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters

Volumn 68, Issue 3, 1998, Pages 119-124

  Jurdziński, Marcin ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Computational complexity; Games on graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MODAL ANALYSIS; SET THEORY;

MEAN PAYOFF GAMES; PARITY GAMES;

GAME THEORY;

EID: 0032203664     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00150-1     Document Type: Article

References (14)

1. A. Condon, The complexity of stochastic games, Inform. and Comput. 96 (1992) 203-224.
2. A. Ehrenfeucht, J. Mycielski, Positional strategies for mean payoff games, Internat. J. Game Theory 8 (2) (1979) 109-113.
3. E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy (Extended abstract), in: Proceedings 32nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1991, pp. 368-377.
4. E.A. Emerson, C.S. Jutla, A.P. Sistla, On model-checking for fragments of μ-calculus, in: C. Courcoubetis (Ed.), Computer Aided Verification, 5th International Conference, CAV'93, Lecture Notes in Comput. Sci., Vol. 697, Springer, Berlin, 1993, pp. 385-396.
5. M.R. Fellows, N. Koblitz, Self-witnessing polynomial-time complexity and prime factorization, in: Proc. 7th Annual Conference on Structure in Complexity Theory, IEEE Computer Society Press, 1992, pp. 107-110.
6. V.A. Gurvich, A.V. Karzanov, L.G. Khachiyan, Cyclic games and an algorithm to find minimax cycle means in directed graphs, USSR Comput. Maths. Math. Phys. 28 (5) (1988) 85-91.
7. A.W. Mostowski, Regular expressions for infinite trees and a standard from of automata, in: A. Skowron (Ed.), Computation Theory, Lecture Notes in Comput. Sci., Vol. 208, Springer, Berlin, 1984, pp. 157-168.
8. A.W. Mostowski, Games with forbidden positions, Technical Report 78, University of Gdańsk, 1991.
9. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
10. A. Puri, Theory of hybrid systems and discrete event systems, Ph.D. Thesis, University of California, Berkeley, CA, 1995.
11. C. Stirling, Local model checking games (Extended abstract), in: I. Lee, S.A. Smolka (Eds.), CONCUR'95: Concurrency Theory, 6th International Conference, Lecture Notes in Comput. Sci., Vol. 962, Springer, Berlin, 1995, pp. 1-11.
12. C. Stirling, Model checking and other games. Manuscript, available through http://www.dcs.ed.ac.uk/home/cps, 1996.
13. I. Walukiewicz, Pushdown processes: Games and model checking, in: T.A. Henzinger, R. Alur (Eds.), Computer Aided Verification, 8th International Conference, CAV'96, Lecture Notes in Comput. Sci., Vol. 1102, Springer, Berlin, 1996, pp. 62-74, Full version available through http://zls.mimuw.edu.pl/igw.
14. U. Zwick, M. Paterson, The complexity of mean payoff games on graphs, Theoret. Comput. Sci. 158 (1996) 343-359.