Exact Algorithms for Solving Stochastic Games

Research output: Working paper/Preprint Working paperResearch


Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.
Original languageEnglish
Number of pages34
Publication statusPublished - 2012


  • protocols
  • authentication
  • secure computation


Dive into the research topics of 'Exact Algorithms for Solving Stochastic Games'. Together they form a unique fingerprint.

Cite this