Probabilistic Systems with LimSup and LimInf Objectives

Details Probabilistic Systems with LimSup and LimInf Objectives Probabilistic Systems with LimSup and LimInf Objectives

2008-09-09

arxiv.org/abs/0809.1465v1

Computer Science

Computer Science and Game Theory

The paper will appear in ILC proceedings

Scientific paper

We give polynomial-time algorithms for computing the values of Markov decision processes (MDPs) with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path in the MDP is the limsup (resp. liminf) of all rewards along the path. The value of an MDP is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the MDP. Using our result on MDPs, we show that turn-based stochastic games with limsup and liminf objectives can be solved in NP \cap coNP.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Systems with LimSup and LimInf Objectives 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 Probabilistic Systems with LimSup and LimInf Objectives, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Systems with LimSup and LimInf Objectives will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210254