Exact Algorithms for Solving Stochastic Games

Research output: 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

    Research areas

  • protocols, authentication, secure computation

See relations at Aarhus University Citationformats

ID: 52513056