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

Akio Yanbe, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルComputing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings
編集者Jin-Yi Cai, Chak Kuen Wong, Chak Kuen Wong
出版社Springer Verlag
ページ310-322
ページ数13
ISBN(印刷版)9783540613329
DOI
出版ステータス出版済み - 1996
イベント2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 - Hong Kong, 香港
継続期間: 6 17 19966 19 1996

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1090
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他2nd Annual International Conference on Computing and Combinatorics, COCOON 1996
Country香港
CityHong Kong
Period6/17/966/19/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル