TY - GEN
T1 - On the complexity of computational problems associated with simple stochastic games
T2 - 2nd Annual International Conference on Computing and Combinatorics, COCOON 1996
AU - Yanbe, Akio
AU - Sakurai, Kouichi
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.
PY - 1996
Y1 - 1996
N2 - We investigate simple stochastic games (SSGs): a kind of two-person games under uncertainty, the original model of which was introduced in [L.S. Shapley, Proc. Nat. Acad. Sci. U.S.A. 39 (1953) 1095–1100]. We consider the computational complexity of 1. deciding whether a given SSG is stopping (discounted) or not, 2. counting the number of all the optimal strategies of SSGs, 3. finding an optimal strategy against the player who takes random strategies.
AB - We investigate simple stochastic games (SSGs): a kind of two-person games under uncertainty, the original model of which was introduced in [L.S. Shapley, Proc. Nat. Acad. Sci. U.S.A. 39 (1953) 1095–1100]. We consider the computational complexity of 1. deciding whether a given SSG is stopping (discounted) or not, 2. counting the number of all the optimal strategies of SSGs, 3. finding an optimal strategy against the player who takes random strategies.
UR - http://www.scopus.com/inward/record.url?scp=84949009028&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949009028&partnerID=8YFLogxK
U2 - 10.1007/3-540-61332-3_165
DO - 10.1007/3-540-61332-3_165
M3 - Conference contribution
AN - SCOPUS:84949009028
SN - 9783540613329
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 310
EP - 322
BT - Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings
A2 - Cai, Jin-Yi
A2 - Wong, Chak Kuen
A2 - Wong, Chak Kuen
PB - Springer Verlag
Y2 - 17 June 1996 through 19 June 1996
ER -