## Complexity results for Infinite-Horizon Markov Decision Processes (2000)

by
Omid Madani

Citations: | 15 - 3 self |

### BibTeX

@MISC{Madani00complexityresults,

author = {Omid Madani},

title = {Complexity results for Infinite-Horizon Markov Decision Processes},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

Markov decision processes (MDPs) are models of dynamic decision making under uncertainty. These models arise in diverse applications and have been developed extensively in fields such as operations research, control engineering, and the decision sciences in general. Recent research, especially in artificial intelligence, has highlighted the significance of studying the computational properties of MDP problems. We address