Stopping times and Markov programming

J. Wessels

Research output: Book/ReportReportAcademic

110 Downloads (Pure)

Abstract

Using stopping times, a class of successive approximation methods for discounted Markov decision problems is constructed. This class contains many known procedures and a number of new ones.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages12
Publication statusPublished - 1974

Publication series

NameMemorandum COSOR
Volume7409
ISSN (Print)0926-4493

Fingerprint Dive into the research topics of 'Stopping times and Markov programming'. Together they form a unique fingerprint.

Cite this