The Complexity of Stochastic Games
File(s)
Date
1989Author
Condon, Anne
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Metadata
Show full item recordAbstract
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.
Permanent Link
http://digital.library.wisc.edu/1793/59156Citation
TR863