Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2008
Springer

favoriteEmaildiscussreport

101views Education» more CORR 2008»

Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games

13 years 4 months ago

Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games

Download wwwbrauer.informatik.tu-muenchen.de

Abstract. This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to some non-empty subset of possible actions at a given node, instead of limiting himself to exactly one action. We show that a strategy-improvement algorithm by by Bj

Michael Luttenberger

Real-time Traffic

Algorithm | CORR 2008 | Education | Non-deterministic Strategies | Parity Game |

claim paper

Related Content

» An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know i...

» An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games

» The complexity of solving reachability games using value and strategy iteration

» Strategy Construction for Parity Games with Imperfect Information

» MeanPayoff Parity Games

» Timed Parity Games Complexity and Robustness

» A Solver for Modal Fixpoint Logics

» Games through Nested Fixpoints

» Solving Stackelberg games with uncertain observability

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Michael Luttenberger

Comments (0)