Deciding the Winner in Parity Games is in UP \cap co-Up

  title={Deciding the Winner in Parity Games is in UP \cap co-Up},
  author={Marcin Jurdzinski},
  journal={Inf. Process. Lett.},
  • M. Jurdzinski
  • Published 15 November 1998
  • Economics
  • Inf. Process. Lett.
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
It is proved that deciding (the permissiveness of) a most permissive winning strategy is in NP ∩ coNP, which provides a new study of mean-payoff parity games and gives a new algorithm for solving these games, which beats all previously known algorithms for this problem.
A Linear Time Special Case for MC Games
It is shown that, if all cycles in each strongly connected component of the game graph have at least one common vertex, the winner can be found in linear time.
Small Progress Measures for Solving Parity Games
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.
Winning Cores in Parity Games
  • S. Vester
  • Computer Science, Economics
    2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
It is shown that the winning core and the winning region for a player in a parity game are equivalently empty, and a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation is developed.
Parity Games of Bounded Tree- and Clique-Width
It is shown that deciding the winner of a parity game is in LogCFL, if the underlying graph has bounded tree-width, and in LogDCFL, and it is proven that parity games of bounded clique-width can be solved in logCFL via a log-space reduction to the bounded tree's width case.
The priority promotion approach to parity games
A new family of algorithms is presented, based on the idea of promoting vertices to higher priorities during the search for winning regions, for the solution of parity games, exhibiting the best space complexity among the currently known solutions.
Reduction of stochastic parity to stochastic mean-payoff games
Solving Mean-Payoff Games via Quasi Dominions
A novel algorithm is proposed for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions and significantly speeds up convergence to the problem solution.
Solving Parity Games Using an Automata-Based Algorithm
Parity games are abstract infinite-round games that take an important role in formal verification and are implemented in a platform named PGSolver, which enabled an empirical evaluation of these algorithms and a better understanding of their relative merits.
Stuttering Equivalence for Parity Games
It is demonstrated that stuttering equivalent vertices have the same winner in the parity game, which means that solving a parity game can be accelerated by minimising the game graph with respect to stuttering equivalence.


The Complexity of Mean Payoff Games
A pseudopolynomial time algorithm for the solution of mean payoff games, a family of perfect information games introduced by Ehrenfeucht and Mycielski, the decision problem for which is in NP ∩ co-NP.
The Complexity of Stochastic Games
The Complexity of Mean Payoff Games on Graphs
Pushdown Processes: Games and Model-Checking
It is shown that the model checking problem for push-down automata and the propositional μ-calculus is DEXPTIME-complete and there is a winning strategy which is realized by a pushdown process.
Positional strategies for mean payoff games
We study some games of perfect information in which two players move alternately along the edges of a finite directed graph with weights attached to its edges. One of them wants to maximize and the
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
The propositional Mu-Calculus is equivalent in expressive power to finite automata on infinite trees and provides a radically simplified, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results.
On Model-Checking for Fragments of µ-Calculus
It is shown that the logic L2 is as expressive as ECTL* given in [13], and the model checking problem for the μ-calculus is equivalent to the non-emptiness problem of parity tree automata.
Tree Automata
A context-free grammar over the terminal alphabet generating the Dyck language of well-bracketed strings and a product construction for nondeterministic bu-ta A 1 and A 2, to discuss whether there are simpler means of specifying them formally.
Theory of hybrid systems and discrete event systems
  • A. Puri
  • Mathematics, Computer Science
  • 1996
It is shown that for hybrid automata with rectangular inclusions, the reachability question can be answered in a finite number of steps and that an $\omega$-automata game with the chain acceptance condition can be solved as a mean payoff game.