Skip to main content
Book Chapter

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games

  • Schewe S
Springer Berlin Heidelberg, (2008), 369-384
DOI: 10.1007/978-3-540-87531-4_27
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local strategy modifications. Current strategy improvement methods stepwise improve the strategy...

Cite

CITATION STYLE

APA

Schewe, S. (2008). An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games. In Computer Science Logic (pp. 369–384). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free