scispace - formally typeset
Open AccessBook

Markov Decision Processes: Discrete Stochastic Dynamic Programming

Reads0
Chats0
TLDR
Puterman as discussed by the authors provides a uniquely up-to-date, unified, and rigorous treatment of the theoretical, computational, and applied research on Markov decision process models, focusing primarily on infinite horizon discrete time models and models with discrete time spaces while also examining models with arbitrary state spaces, finite horizon models, and continuous time discrete state models.
Abstract
From the Publisher: The past decade has seen considerable theoretical and applied research on Markov decision processes, as well as the growing use of these models in ecology, economics, communications engineering, and other fields where outcomes are uncertain and sequential decision-making processes are needed. A timely response to this increased activity, Martin L. Puterman's new work provides a uniquely up-to-date, unified, and rigorous treatment of the theoretical, computational, and applied research on Markov decision process models. It discusses all major research directions in the field, highlights many significant applications of Markov decision processes models, and explores numerous important topics that have previously been neglected or given cursory coverage in the literature. Markov Decision Processes focuses primarily on infinite horizon discrete time models and models with discrete time spaces while also examining models with arbitrary state spaces, finite horizon models, and continuous-time discrete state models. The book is organized around optimality criteria, using a common framework centered on the optimality (Bellman) equation for presenting results. The results are presented in a "theorem-proof" format and elaborated on through both discussion and examples, including results that are not available in any other book. A two-state Markov decision process model, presented in Chapter 3, is analyzed repeatedly throughout the book and demonstrates many results and algorithms. Markov Decision Processes covers recent research advances in such areas as countable state space models with average reward criterion, constrained models, and models with risk sensitive optimality criteria. It also explores several topics that have received little or no attention in other books, including modified policy iteration, multichain models with average reward criterion, and sensitive optimality. In addition, a Bibliographic Remarks section in each chapter comments on relevant historic

read more

Citations
More filters
Proceedings ArticleDOI

A markov chain approximation to choice modeling

TL;DR: In this article, a Markov chain choice model is proposed, where substitution from one product to another is modelled as a state transition of a markov chain and the preferences of the customers are approximated by Markovian transitions in this choice model.
Journal ArticleDOI

A model for optimally dispatching ambulances to emergency calls with classification errors in patient priorities

TL;DR: A model for determining how to optimally dispatch ambulances to patients to maximize the long-run average utility of the system, defined as the expected coverage of true high-risk patients.
Proceedings ArticleDOI

Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control

TL;DR: In this article, the authors restrict their attention to an important class of deterministic optimal control problems: those with dynamics that are affine in the control and cost that is quadratic in control.
Journal ArticleDOI

Adaptive opportunistic routing for wireless ad hoc networks

TL;DR: A distributed adaptive opportunistic routing scheme for multihop wireless ad hoc networks that utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model is proposed.
Journal ArticleDOI

A Network-Assisted Approach for RAT Selection in Heterogeneous Cellular Networks

TL;DR: A network-assisted approach to optimal, learning-based, and heuristic policies, such as blocking probability and average throughput, and a reinforcement learning approach is introduced to derive what to signal to mobiles.
References
More filters
Book

Functional analysis

Walter Rudin
Book

Dynamic Programming

TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Journal ArticleDOI

Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy

TL;DR: A new algorithm for computing optimal ( s , S ) policies is derived based upon a number of new properties of the infinite horizon cost function c as well as a new upper bound for optimal order-up-to levels S * and a new lower bound for ideal reorder levels s *.
Related Papers (5)