@inproceedings{3e82e93d77844bd6aeb984d3895a6fb2,
title = "On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96",
abstract = "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.",
author = "Akio Yanbe and Kouichi Sakurai",
year = "1996",
doi = "10.1007/3-540-61332-3_165",
language = "English",
isbn = "9783540613329",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "310--322",
editor = "Jin-Yi Cai and Wong, {Chak Kuen} and Wong, {Chak Kuen}",
booktitle = "Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings",
address = "Germany",
note = "2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 ; Conference date: 17-06-1996 Through 19-06-1996",
}