Markov programming by successive approximations with respect to weighted supremum norms

J. Wessels

Research output: Contribution to journalArticleAcademicpeer-review

59 Citations (Scopus)

Abstract

Markovian decision processes are considered in the situation of discrete time, countable state space, and general decision space. By introducing a Banach space with a weighted supremum norm, conditions are derived, which guarantee convergence of successive approximations to the value function. These conditions are weaker then those required by the usual supnorm approach. Several properties of the successive approximations are derived.
Original languageEnglish
Pages (from-to)326-335
Number of pages10
JournalJournal of Mathematical Analysis and Applications
Volume58
Issue number2
DOIs
Publication statusPublished - 1977

Fingerprint

Dive into the research topics of 'Markov programming by successive approximations with respect to weighted supremum norms'. Together they form a unique fingerprint.

Cite this