The Complexity of Stochastic Games

Simple item page
dc.contributor.authorCondon, Anneen_US
dc.date.accessioned2012-03-15T16:51:05Z
dc.date.available2012-03-15T16:51:05Z
dc.date.created1989en_US
dc.date.issued1989
dc.description.abstractWe 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR863
dc.identifier.urihttp://digital.library.wisc.edu/1793/59156
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleThe Complexity of Stochastic Gamesen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR863.pdf
Size:
1.56 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports