An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
From MaRDI portal
Publication:3540191
DOI10.1007/978-3-540-87531-4_27zbMath1156.68478MaRDI QIDQ3540191
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
91A43: Games involving graphs
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Unnamed Item, Incentive Stackelberg Mean-Payoff Games, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Solving Mean-Payoff Games via Quasi Dominions, Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria, Justifications and a reconstruction of parity game solving algorithms, The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs, Verification of reactive systems via instantiation of parameterised Boolean equation systems, Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games, Solving parity games via priority promotion, A delayed promotion policy for parity games, Robust worst cases for parity games algorithms, A superpolynomial lower bound for strategy iteration based on snare memorization, Solving Parity Games Using an Automata-Based Algorithm, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, Recursive algorithm for parity games requires exponential time, The mu-calculus and Model Checking, Graph Games and Reactive Synthesis, From Parity and Payoff Games to Linear Programming, Symmetric Strategy Improvement, Solving Parity Games in Practice
