The Complexity of Stochastic Games
Loading...
Files
Date
Authors
Condon, Anne
Advisors
License
DOI
Type
Technical Report
Journal Title
Journal ISSN
Volume Title
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Grantor
Abstract
We consider the complexity of stochastic games � simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP ? co-NP.
Description
Keywords
Related Material and Data
Citation
TR863