Computer Science – Computer Science and Game Theory
Scientific paper
2012-02-17
Computer Science
Computer Science and Game Theory
Scientific paper
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.
Hansen Kristoffer Arnsfelt
Koucky Michal
Lauritzen Niels
Miltersen Peter Bro
Tsigaridas Elias
No associations
LandOfFree
Exact Algorithms for Solving Stochastic Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Exact Algorithms for Solving Stochastic Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Algorithms for Solving Stochastic Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35964