<div class="description">
<dl><dd>"NPS-55-82-034."</dd>
<dd>"December 1982."</dd>
<dd>Cover title</dd>
<dd>"Prepared for: Naval Postgraduate School, Monterey, California 93943." -- Cover</dd>
<dd>Includes bibliographic references (p. 9)</dd>
<dd>Technical report; 1982</dd>
<dd>This note describes the results of a computational comparison of value iteration algorithms suggested for solving finite state discounted Markov decision processes. Such a process visits a set of states S = (1,2,...M). In Section two we describe the schemes examined and the various bounds that can be used for stopping them. Section three concentrates on one scheme that did well in the comparison - ordinary value iteration - and looks at various methods for eliminating non-optimal actions both permanently and temporarily</dd></dl><br>Subjects: Markov processes; Iterative methods (Mathematics); Decision making; Algorithms</div>
<div class="fn value">
Thomas, L. C.Hartley, R.Lavercombe, A. C.</div>
Internet Archive identifier