My UW | UW Search

   
   

Computer Science Home Page
 
 
 
Computer Sciences Dept.

The Complexity of Stochastic Games

Anne Condon
1989

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.

Download this report (PDF)

Return to tech report index

 
Computer Science | UW Home

Feedback or content questions: send email to "pubs" at the cs.wisc.edu server
Technical or accessibility issues: lab@cs.wisc.edu
Copyright © 2002, 2003, 2004, 2005, 2006, 2007  The Board of Regents of the University of Wisconsin System.