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
EditorsChak Kuen Wong, Chak Kuen Wong, Jin-Yi Cai
PublisherSpringer Verlag
Pages310-322
Number of pages13
ISBN (Print)9783540613329
Publication statusPublished - Jan 1 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
CountryHong Kong
CityHong Kong
Period6/17/966/19/96

Fingerprint

Simple Game
Stochastic Games
Computational complexity
Optimal Strategy
Two-person Games
Counting
Computational Complexity
Uncertainty
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yanbe, A., & Sakurai, K. (1996). On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96. In C. K. Wong, C. K. Wong, & J-Y. Cai (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.

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 proceedingConference contribution

Yanbe, A & Sakurai, K 1996, On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96. in CK Wong, CK Wong & J-Y Cai (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.
Yanbe A, Sakurai K. On the complexity of computational problems associated with simple stochastic games: Extended abstract of COCOON'96. In Wong CK, Wong CK, Cai J-Y, 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)).
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 / Chak Kuen Wong ; Chak Kuen Wong ; Jin-Yi Cai. 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",
month = "1",
day = "1",
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 = "Wong, {Chak Kuen} and Wong, {Chak Kuen} and Jin-Yi Cai",
booktitle = "Computing and Combinatorics - 2nd Annual International Conference, COCOON 1996, Proceedings",
address = "Germany",

}

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 -