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

Deep Reinforcement Learning based Resource Allocation in Low Latency Edge Computing Networks

TL;DR: This paper designs an intelligent agent at the edge computing node to develop a real-time adaptive policy for computational resource allocation for offloaded tasks of multiple users in order to improve the average E2E reliability.
Proceedings Article

Optimistic Knowledge Gradient Policy for Optimal Budget Allocation in Crowdsourcing

TL;DR: A novel approximate policy is proposed which is called optimistic knowledge gradient which is practically efficient while theoretically its consistency can be guaranteed and extended to deal with inhomogeneous workers and tasks with contextual information available.
Proceedings ArticleDOI

Assessing the potential of predictive control for hybrid vehicle powertrains using stochastic dynamic programming

TL;DR: In this article, the potential for reduced fuel consumption of hybrid electric vehicles by the use of predictive powertrain control was assessed by evaluating the fuel consumption using three optimal controllers, each with a different level of information access to the driven route.
Journal ArticleDOI

A stochastic programming approach for clinical trial planning in new drug development

TL;DR: The paper presents a multi-stage stochastic programming formulation for the planning of clinical trials in the pharmaceutical research and development (R&D) pipeline that employs a reduced set of scenarios without compromising the quality of uncertainty representation.
Proceedings ArticleDOI

Optimal Dynamic Spectrum Access via Periodic Channel Sensing

TL;DR: The optimal dynamic spectrum access problem can be formulated within the framework of constrained Markov decision processes (CMDPs) and the optimal control policy is identified via a linear program and its performance is analyzed numerically and through Monte Carlo simulations.
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)