On the computational complexity of solving stochastic mean-payoff games

Details On the computational complexity of solving stochastic mean-payoff games On the computational complexity of solving stochastic mean-payoff games

2008-12-02

arxiv.org/abs/0812.0486v1

Computer Science

Computer Science and Game Theory

s

Scientific paper

We consider some well-known families of two-player, zero-sum, perfect information games that can be viewed as special cases of Shapley's stochastic games. We show that the following tasks are polynomial time equivalent: - Solving simple stochastic games. - Solving stochastic mean-payoff games with rewards and probabilities given in unary. - Solving stochastic mean-payoff games with rewards and probabilities given in binary.

Affiliated with

Also associated with

No associations

Rating

On the computational complexity of solving stochastic 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 On the computational complexity of solving stochastic mean-payoff games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the computational complexity of solving stochastic mean-payoff games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-718760