Discrete-Time Markov Control Processes: Basic Optimality Criteria

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book presents the first part of a planned two-volume series devoted to a systematic exposition of some recent developments in the theory of discrete-time Markov control processes (MCPs). Interest is mainly confined to MCPs with Borel state and control (or action) spaces, and possibly unbounded costs and noncompact control constraint sets. MCPs are a class of stochastic control problems, also known as Markov decision processes, controlled Markov processes, or stochastic dynamic pro­ grams; sometimes, particularly when the state space is a countable set, they are also called Markov decision (or controlled Markov) chains. Regardless of the name used, MCPs appear in many fields, for example, engineering, economics, operations research, statistics, renewable and nonrenewable re­ source management, (control of) epidemics, etc. However, most of the lit­ erature (say, at least 90%) is concentrated on MCPs for which (a) the state space is a countable set, and/or (b) the costs-per-stage are bounded, and/or (c) the control constraint sets are compact. But curiously enough, the most widely used control model in engineering and economics--namely the LQ (Linear system/Quadratic cost) model-satisfies none of these conditions. Moreover, when dealing with "partially observable" systems) a standard approach is to transform them into equivalent "completely observable" sys­ tems in a larger state space (in fact, a space of probability measures), which is uncountable even if the original state process is finite-valued.

Author(s): Onésimo Hernández-Lerma, Jean Bernard Lasserre (auth.)
Series: Applications of Mathematics 30
Edition: 1
Publisher: Springer-Verlag New York
Year: 1996

Language: English
Pages: 216
Tags: Probability Theory and Stochastic Processes

Front Matter....Pages i-xiv
Introduction and Summary....Pages 1-12
Markov Control Processes....Pages 13-21
Finite-Horizon Problems....Pages 23-42
Infinite-Horizon Discounted-Cost Problems....Pages 43-73
Long-Run Average-Cost Problems....Pages 75-124
The Linear Programming Formulation....Pages 125-167
Back Matter....Pages 169-216