The Complexity of Solving Stochastic Games on Graphs

  • Daniel Andersson
  • Peter Bro Miltersen
Conference paper

DOI: 10.1007/978-3-642-10631-6_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5878)
Cite this paper as:
Andersson D., Miltersen P.B. (2009) The Complexity of Solving Stochastic Games on Graphs. In: Dong Y., Du DZ., Ibarra O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg

Abstract

We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. The families include stochastic parity games, stochastic mean payoff games, and simple stochastic games. We show that the tasks of solving games in each of these classes (quantitiatively or strategically) are all polynomial time equivalent. In addition, we exhibit a linear time algorithm that given a simple stochastic game and the values of all positions of that game, computes a pair of optimal strategies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Daniel Andersson
    • 1
  • Peter Bro Miltersen
    • 1
  1. 1.Department of Computer ScienceAarhus UniversityDenmark

Personalised recommendations