An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
From MaRDI portal
Publication:3540191
DOI10.1007/978-3-540-87531-4_27zbMATH Open1156.68478OpenAlexW1887255787MaRDI QIDQ3540191FDOQ3540191
Authors: Sven Schewe 
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_27
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)
Cited In (40)
- An improved heuristic for the ``Ulam-Rényi game
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Title not available (Why is that?)
- The complexity of all-switches strategy improvement
- Solving parity games via priority promotion
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- On an algorithm for successive improvement of a strategy
- Strategy optimization for static games based on STP method
- Parity games with weights
- The mu-calculus and Model Checking
- Solving parity games using an automata-based algorithm
- Strategy Construction for Parity Games with Imperfect Information
- A delayed promotion policy for parity games
- A delayed promotion policy for parity games
- Priority promotion with Parysian flair
- Incentive Stackelberg mean-payoff games
- Graph Games and Reactive Synthesis
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Efficient parallel strategy improvement for parity games
- Solving mean-payoff games via quasi dominions
- From Parity and Payoff Games to Linear Programming
- Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria
- Robust worst cases for parity games algorithms
- Solving mean-payoff games via quasi dominions
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Justifications and a reconstruction of parity game solving algorithms
- Local strategy improvement for parity game solving
- Title not available (Why is that?)
- Improvement in small progress measures
- Solving parity games in practice
- Non-oblivious strategy improvement
- A flexible toolchain for symbolic Rabin games under fair and stochastic uncertainties
- Partial solvers for parity games: effective polynomial-time composition
- A global optimization algorithm for solving a four-person game
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- Symmetric strategy improvement
- Recursive algorithm for parity games requires exponential time
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540191)
