Energy and Mean-Payoff Parity Markov Decision Processes

Details Energy and Mean-Payoff Parity Markov Decision Processes Energy and Mean-Payoff Parity Markov Decision Processes

2011-04-14

arxiv.org/abs/1104.2909v1

Computer Science

Computer Science and Game Theory

Scientific paper

We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives. In system design, the parity objective is used to encode \omega-regular specifications, and the mean-payoff and energy objectives can be used to model quantitative resource constraints. The energy condition requires that the resource level never drops below 0, and the mean-payoff condition requires that the limit-average value of the resource consumption is within a threshold. While these two (energy and mean-payoff) classical conditions are equivalent for two-player games, we show that they differ for MDPs. We show that the problem of deciding whether a state is almost-sure winning (i.e., winning with probability 1) in energy parity MDPs is in NP \cap coNP, while for mean-payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound.

Affiliated with

Also associated with

No associations

Rating

Energy and Mean-Payoff Parity Markov Decision Processes 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 Energy and Mean-Payoff Parity Markov Decision Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Energy and Mean-Payoff Parity Markov Decision Processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-7912