Name
Abstract | ||
|---|---|---|
We present a new algorithm for solving Simple Stochastic Games (SSGs), which is fixed parameter tractable when parametrized with the number of random vertices. This algorithm is based on an exhaustive search of a special kind of positional optimal strategies, the f-strategies. The running time is , where and 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 performs well on SSGs with few random vertices, second it does not rely on linear or quadratic programming, third it applies to all SSGs, not only stopping SSGs. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-69407-6_24 | CiE |
Keywords | Field | DocType |
simple stochastic games,exhaustive search,quadratic programming,maximum bit-length,random vertex,new algorithm,positional optimal strategy,transition probability,special kind,parameter tractable,quadratic program | Discrete mathematics,Combinatorics,Vertex (geometry),Parametrization,Brute-force search,Computer science,Markov decision process,Quadratic programming,Stochastic game | Conference |
Volume | ISSN | Citations |
5028 | 0302-9743 | 3 |
PageRank | References | Authors |
0.52 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hugo Gimbert | 1 | 249 | 21.31 |
| Florian Horn | 2 | 53 | 6.57 |