A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices. (Q1426778): Difference between revisions

The author presents a new weakly monotonic backward induction algorithm working on bounded subsets of vector lattices. He proves some properties, gives examples and applications and illustrates the behavior of the algorithm. He describes a new way of handling weakly monotonic policies for nonstationary Markov decision processes in partially ordered spaces.