Solving parity games via priority promotion
From MaRDI portal
Publication:1742991
DOI10.1007/s10703-018-0315-1zbMath1390.68332OpenAlexW2791055336MaRDI QIDQ1742991
Fabio Mogavero, Daniele Dell'Erba, Massimo Benerecetti
Publication date: 12 April 2018
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:db0d91fd-11a4-47b4-8d83-c8dc3a23f654
Related Items (6)
Robust worst cases for parity games algorithms ⋮ Improved complexity analysis of quasi-polynomial algorithms solving parity games ⋮ Solving mean-payoff games via quasi dominions ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Strategy logic
- Positional strategies for mean payoff games
- The complexity of stochastic games
- Self-witnessing polynomial-time complexity and prime factorization
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- The complexity of mean payoff games on graphs
- Energy parity games
- Fixed-point logics and solitaire games
- PRIMES is in P
- Automata, logics, and infinite games. A guide to current research
- Entanglement and the complexity of directed graphs
- On Promptness in Parity Games
- Generalized Mean-payoff and Energy Games
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
- Finitary winning in ω-regular games
- Reasoning About Strategies
- Reasoning About Substructures and Games
- Games and Model Checking for Guarded Logics
- Non-oblivious Strategy Improvement
- Parity Games on Graphs with Medium Tree-Width
- Time and Parallelizability Results for Parity Games with Bounded Treewidth
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Alternating-time temporal logic
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- ATL* Satisfiability Is 2EXPTIME-Complete
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- A deterministic subexponential algorithm for solving parity games
- Clique-Width and Parity Games
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Solving Parity Games in Practice
- Solving Parity Games via Priority Promotion
- Deciding parity games in quasipolynomial time
- Substructure Temporal Logic
- DAG-Width and Parity Games
- Solving Parity Games in Big Steps
- Parity and Streett Games with Costs
- Computer Aided Verification
- On model checking for the \(\mu\)-calculus and its fragments
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
This page was built for publication: Solving parity games via priority promotion
