A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Simple Stochastic Games with Few Random Vertices Are Easy to Solve
[chapter]
Foundations of Software Science and Computational Structures
We present a new algorithm for solving Simple Stochastic Games (SSGs). This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is O( |VR|! · (|V ||E| + |p|) ), where |V |, |VR|, |E| and |p| are respectively the number of vertices, random vertices and edges, and the maximum bit-length of a transition probability. Our algorithm improves existing algorithms for solving SSGs in three aspects. First, our algorithm
doi:10.1007/978-3-540-78499-9_2
dblp:conf/fossacs/GimbertH08
fatcat:of7cmuiilrcmvf4v6lmekcwvai