On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96

Akio Yanbe; Kouichi Sakurai

doi:10.1007/3-540-61332-3_165

On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96

Akio Yanbe, Kouichi Sakurai

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	Jin-Yi Cai, Chak Kuen Wong, Chak Kuen Wong
Publisher	Springer Verlag
Pages	310-322
Number of pages	13
ISBN (Print)	9783540613329
DOIs	https://doi.org/10.1007/3-540-61332-3_165
Publication status	Published - 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

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-61332-3_165

Fingerprint Dive into the research topics of 'On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96'. Together they form a unique fingerprint.

Cite this

Yanbe, A., & Sakurai, K. (1996). On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96. In J-Y. Cai, C. K. Wong, & C. K. Wong (Eds.), Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings (pp. 310-322). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1090). Springer Verlag. https://doi.org/10.1007/3-540-61332-3_165

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. / Jin-Yi Cai; Chak Kuen Wong; Chak Kuen Wong. 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

Yanbe, A & Sakurai, K 1996, On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96. in J-Y Cai, CK Wong & CK Wong (eds), Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1090, Springer Verlag, pp. 310-322, 2nd Annual International Conference on Computing and Combinatorics, COCOON 1996, Hong Kong, Hong Kong, 6/17/96. https://doi.org/10.1007/3-540-61332-3_165

Yanbe A, Sakurai K. On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96. In Cai J-Y, Wong CK, Wong CK, editors, Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings. Springer Verlag. 1996. p. 310-322. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-61332-3_165

Yanbe, Akio ; Sakurai, Kouichi. / On the complexity of computational problems associated with simple stochastic games : Extended abstract of COCOON'96. Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings. editor / Jin-Yi Cai ; Chak Kuen Wong ; Chak Kuen Wong. Springer Verlag, 1996. pp. 310-322 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

}

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

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

PB - Springer Verlag

Y2 - 17 June 1996 through 19 June 1996

ER -