English

The Complexity of Simple Stochastic Games

Computational Complexity 2007-05-23 v1 Computer Science and Game Theory

Abstract

In this paper we survey the computational time complexity of assorted simple stochastic game problems, and we give an overview of the best known algorithms associated with each problem.

Keywords

Cite

@article{arxiv.0704.2779,
  title  = {The Complexity of Simple Stochastic Games},
  author = {Jonas Dieckelmann},
  journal= {arXiv preprint arXiv:0704.2779},
  year   = {2007}
}
R2 v1 2026-06-21T08:20:42.224Z