New deterministic algorithms for solving parity games
From MaRDI portal
DOI10.1016/j.disopt.2018.06.001zbMath1454.91006arXiv1512.03246OpenAlexW2884283331WikidataQ129501765 ScholiaQ129501765MaRDI QIDQ1756345
Matthias Mnich, Clemens Rösner, Heiko Röglin
Publication date: 14 January 2019
Published in: Discrete Optimization, LATIN 2016: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.03246
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)
Related Items (1)
Cites Work
- 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}\)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- New deterministic algorithms for solving parity games
- Fixed-point logics and solitaire games
- Automata, logics, and infinite games. A guide to current research
- A subexponential randomized algorithm for the simple stochastic game problem
- Entanglement and the complexity of directed graphs
- Parameterized Algorithms for Parity Games
- 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
- Clique-Width and Parity Games
- Deciding parity games in quasipolynomial time
- DAG-Width and Parity Games
- Solving Parity Games in Big Steps
- Computer Aided Verification
This page was built for publication: New deterministic algorithms for solving parity games
