A delayed promotion policy for parity games
From MaRDI portal
Publication:1784960
DOI10.1016/j.ic.2018.09.005zbMath1400.68119arXiv1609.04087OpenAlexW2964098346WikidataQ129187941 ScholiaQ129187941MaRDI QIDQ1784960
Daniele Dell'Erba, Fabio Mogavero, Massimo Benerecetti
Publication date: 27 September 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04087
Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (2)
Justifications and a reconstruction of parity game solving algorithms ⋮ Solving mean-payoff games via quasi dominions
Uses Software
Cites Work
- 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}\)
- Positional strategies for mean payoff games
- The complexity of stochastic games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- The complexity of mean payoff games on graphs
- Solving parity games via priority promotion
- Automata, logics, and infinite games. A guide to current research
- 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
- Relentful Strategic Reasoning in Alternating-Time Temporal Logic
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Symmetric Strategy Improvement
- Alternating-time temporal logic
- Optimal strategy synthesis for request-response games
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Solving Parity Games in Practice
- Solving Parity Games via Priority Promotion
- Deciding parity games in quasipolynomial time
- Substructure Temporal Logic
- An automata-theoretic approach to branching-time model checking
- Solving Parity Games in Big Steps
- Parity and Streett Games with Costs
- Decidability of DPDA equivalence
- Attracting tangles to solve parity games
This page was built for publication: A delayed promotion policy for parity games
