Abstract
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 language | English |
---|---|
Number of pages | 34 |
Publication status | Published - 2012 |
Keywords
- protocols
- authentication
- secure computation