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

On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding

TL;DR: This paper proposes a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of broadcast packets, compared to the random and greedy selection algorithms with a similar computational complexity.
Journal ArticleDOI

Dynamic treatment regimes: technical challenges and applications.

TL;DR: A critical inferential challenge that results from nonregularity arises in inference for parameters in the optimal dynamic treatment regime is reviewed; the asymptotic, limiting, distribution of estimators are sensitive to local perturbations.
Journal ArticleDOI

Call admission control in mobile cellular networks: a comprehensive survey

TL;DR: A survey of admission control schemes for cellular networks and the research in this area, including those designed for multi-service networks and hierarchical systems as well as complete knowledge schemes and those using pricing for CAC.
Proceedings Article

Breaking the curse of horizon: Infinite-horizon off-policy estimation

TL;DR: In this article, an off-policy estimation method that applies importance sampling directly on the stationary state-visitation distributions to avoid the exploding variance issue faced by existing estimators is proposed.
Journal ArticleDOI

Optimal charging of an electric vehicle using a Markov decision process

TL;DR: In this paper, the authors introduce an efficient stochastic dynamic programming model to optimally charge an electric vehicle while accounting for the uncertainty inherent to its use, and show that the randomness intrinsic to driving needs has a substantial impact on the charging strategy to be implemented.
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)