A discrete strategy improvement algorithm for solving parity games. (Extended abstract)
From MaRDI portal
Recommendations
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Algorithms for solving parity games
- Algorithms for Parity Games
- Local strategy improvement for parity game solving
Cited in
(73)- Model checking for hybrid logic
- Parity game reductions
- Solving parity games via priority promotion
- A delayed promotion policy for parity games
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Improving parity games in practice
- Efficient parallel strategy improvement for parity games
- Robust worst cases for parity games algorithms
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Effectively solvable classes of cyclical games
- Concurrent reachability games
- Games for verification: Algorithmic issues
- Solving parity games using an automata-based algorithm
- Uniform solution of parity games on prefix-recognizable graphs
- Two local strategy iteration schemes for parity game solving
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Improving strategies via SMT solving
- A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
- Recursive algorithm for parity games requires exponential time
- The mu-calculus and Model Checking
- Graph Games and Reactive Synthesis
- From Parity and Payoff Games to Linear Programming
- Semantic labelling and learning for parity game solving in LTL synthesis
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- Solving parity games in big steps
- Symmetric strategy improvement
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games
- Computing Game Values for Crash Games
- Value Iteration
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Solving μ-Calculus Parity Games by Symbolic Planning
- Solving parity games in practice
- A survey of stochastic -regular games
- Solving parity games by a reduction to SAT
- scientific article; zbMATH DE number 1962853 (Why is no real title available?)
- Implementation of a strategy improvement algorithm for finite-state parity games
- The complexity of all-switches strategy improvement
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Permissive strategies: from parity games to safety games
- Switching graphs
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- The fixpoint-iteration algorithm for parity games
- Improvement in small progress measures
- Partial solvers for parity games: effective polynomial-time composition
- A delayed promotion policy for parity games
- Simple fixpoint iteration to solve parity games
- An exponential lower bound for Cunningham's rule
- scientific article; zbMATH DE number 7533361 (Why is no real title available?)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Local strategy improvement for parity game solving
- Parity games with weights
- A Multi-Core Solver for Parity Games
- Solving Parity Games in Big Steps
- An exponential lower bound for Zadeh's pivot rule
- Universal algorithms for parity games and nested fixpoints
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Model checking in the modal -calculus and generic solutions
- On strategy improvement algorithms for simple stochastic games
- Priority promotion with Parysian flair
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- An objective improvement approach to solving discounted payoff games
- The Strahler number of a parity game
- The worst-case complexity of symmetric strategy improvement
- An objective improvement approach to solving discounted payoff games
- Beyond value iteration for parity games: strategy iteration with universal trees
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Pareto fronts for compositionally solving string diagrams of parity games
- Improving parity game solvers with justifications
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Games with winning conditions of high Borel complexity
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- The Rabin index of parity games: its complexity and approximation
- Graph operations on parity games and polynomial-time algorithms
This page was built for publication: A discrete strategy improvement algorithm for solving parity games. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754084)
