Exponential Lower Bounds For Policy Iteration

Details Exponential Lower Bounds For Policy Iteration Exponential Lower Bounds For Policy Iteration

2010-03-17

arxiv.org/abs/1003.3418v1

Computer Science

Data Structures and Algorithms

Scientific paper

We study policy iteration for infinite-horizon Markov decision processes. It
has recently been shown policy iteration style algorithms have exponential
lower bounds in a two player game setting. We extend these lower bounds to
Markov decision processes with the total reward and average-reward optimality
criteria.

Affiliated with

Also associated with

No associations

Rating

Exponential Lower Bounds For Policy Iteration 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 Exponential Lower Bounds For Policy Iteration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential Lower Bounds For Policy Iteration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234450