The Complexity of Simple Stochastic Games

Simple item page
dc.creatorDieckelmann, Jonas
dc.date2007-04-20
dc.date.accessioned2026-07-07T07:57:39Z
dc.date.available2026-07-07T07:57:39Z
dc.descriptionIn 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.
dc.descriptionHi, 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
dc.identifierhttps://arxiv.org/abs/0704.2779
dc.identifierhttp://arxiv.org/abs/0704.2779
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127721
dc.subjectComputational Complexity
dc.subjectComputer Science and Game Theory
dc.titleThe Complexity of Simple Stochastic Games
dc.typetext

Files

Collections

arXiv