A deterministic subexponential algorithm for solving parity games

DOI10.1145/1109557.1109571MaRDI QIDQ3581528zbMATH OpenOpenAlexFDO

Authors Marcin Jurdziński, Uri Zwick, Mike Paterson

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.7326

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Games involving graphs (91A43)

Cited in

(33)

• Parity game reductions
• A convex programming-based algorithm for mean payoff stochastic games with perfect information
• Solving parity games via priority promotion
• Robust worst cases for parity games algorithms
• A superpolynomial lower bound for strategy iteration based on snare memorization
• Concurrent reachability games
• Recursive algorithm for parity games requires exponential time
• Graph Games and Reactive Synthesis
• Cooking Your Own Parity Game Preorders Through Matching Plays
• scientific article; zbMATH DE number 7445162 (Why is no real title available?)
• A CSP-Based Approach for Solving Parity Game
• Value Iteration
• The Descriptive Complexity of Parity Games
• Inf-datalog, Modal Logic and Complexities
• Solving μ-Calculus Parity Games by Symbolic Planning
• Solving parity games in practice
• On canonical forms for zero-sum stochastic mean payoff games
• Alternating traps in Muller and parity games
• A survey of stochastic -regular games
• Solving parity games by a reduction to SAT
• The complexity of all-switches strategy improvement
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• The complexity of rational synthesis for concurrent games
• Improvement in small progress measures
• Partial solvers for parity games: effective polynomial-time composition
• Meanings of model checking
• A Multi-Core Solver for Parity Games
• Solving Parity Games in Big Steps
• Priority promotion with Parysian flair
• A quasi-polynomial black-box algorithm for fixed point evaluation
• Graph operations on parity games and polynomial-time algorithms
• On short paths interdiction problems: Total and node-wise limited interdiction
• Cyclic games and linear programming

This page was built for publication: A deterministic subexponential algorithm for solving parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581528)