Computer Science – Computer Science and Game Theory
Scientific paper
2010-06-08
EPTCS 25, 2010, pp. 7-21
Computer Science
Computer Science and Game Theory
Scientific paper
10.4204/EPTCS.25.5
We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are optimal for priority mean-payoff games establishing a strong link between these two classes.
Gimbert Hugo
Zielonka Wiesław
No associations
LandOfFree
Blackwell-Optimal Strategies in Priority Mean-Payoff 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 Blackwell-Optimal Strategies in Priority Mean-Payoff Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Blackwell-Optimal Strategies in Priority Mean-Payoff Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29286