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.
| Original language | English |
|---|---|
| Title of host publication | Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings |
| Editors | Chak Kuen Wong, Chak Kuen Wong, Jin-Yi Cai |
| Publisher | Springer Verlag |
| Pages | 310-322 |
| Number of pages | 13 |
| ISBN (Print) | 9783540613329 |
| Publication status | Published - Jan 1 1996 |
| Event | 2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 - Hong Kong, Hong Kong Duration: Jun 17 1996 → Jun 19 1996 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1090 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 |
|---|---|
| Country | Hong Kong |
| City | Hong Kong |
| Period | 6/17/96 → 6/19/96 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
On the complexity of computational problems associated with simple stochastic games : Extended abstract of COCOON'96. / Yanbe, Akio; Sakurai, Kouichi.
Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings. ed. / Chak Kuen Wong; Chak Kuen Wong; Jin-Yi Cai. Springer Verlag, 1996. p. 310-322 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1090).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On the complexity of computational problems associated with simple stochastic games
T2 - Extended abstract of COCOON'96
AU - Yanbe, Akio
AU - Sakurai, Kouichi
PY - 1996/1/1
Y1 - 1996/1/1
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
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 - Wong, Chak Kuen
A2 - Wong, Chak Kuen
A2 - Cai, Jin-Yi
PB - Springer Verlag
ER -