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

Akio Yanbe, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationComputing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings
EditorsJin-Yi Cai, Chak Kuen Wong, Chak Kuen Wong
PublisherSpringer Verlag
Pages310-322
Number of pages13
ISBN (Print)9783540613329
DOIs
Publication statusPublished - 1996
Event2nd Annual International Conference on Computing and Combinatorics, COCOON 1996 - Hong Kong, Hong Kong
Duration: Jun 17 1996Jun 19 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1090
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd Annual International Conference on Computing and Combinatorics, COCOON 1996
Country/TerritoryHong Kong
CityHong Kong
Period6/17/966/19/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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