Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games

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

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Michael Luttenberger
• Keywords: Algorithm, CORR 2008, Education, Non-deterministic Strategies, Parity Game