11:50 12.50 pm, Lecture Hall 802 On the complexity of Value Iteration Nikhil Balaji University of Oxford. 090120 Abstract Value iteration is a fundamental algorithm for solving Markov Decision Processes (MDPs). It computes the maximal $n$step payoff by iterating $n$ times a recurrence equation which is naturally associated to the MDP. At the same time, value iteration provides a policy for the MDP that is optimal on a given finite horizon $n$. In this paper, we settle the computational complexity of value iteration. We show that, given a horizon $n$ in binary and an MDP, computing an optimal policy is \EXPcomplete, thus resolving an open problem that goes back to the seminal 1987 paper on the complexity of MDPs by Papadimitriou and Tsitsiklis. To obtain this main result, we develop several stepping stones that yield results of an independent interest. For instance, we show that it is \EXPcomplete to compute the $n$fold iteration (with $n$ in binary) of a function given by a straightline program over the integers with $\max$ and $+$ as operators. We also provide new complexity results for the bounded halting problem in linearupdate counter machines. Joint work with Stefan Kiefer, Petr Novotny, Guillermo Perez and Mahsa Shirmohammadi.
