The Complexity of Simple Stochastic Games

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Hi, while reading through literature i noticed that it has not yet been proved that computing the value vector of simple stochastic games is a Problem in FNP. This is why i came up with a prove in this seminar work of mine

Citation

Consulte el texto completo en el siguiente enlace:

Collections