arXiv
Open Access
2010
Exponential Lower Bounds For Policy Iteration
John Fearnley
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
J
John Fearnley
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2010
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓