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 Vertical Handoff Decision Algorithm for Heterogeneous Wireless Networks

TL;DR: Numerical results show good performance of the proposed scheme over two other vertical handoff decision algorithms, namely: SAW (simple additive weighting) and GRA (grey relational analysis).
Journal ArticleDOI

Monotonicity of Constrained Optimal Transmission Policies in Correlated Fading Channels With ARQ

TL;DR: The main result is to give sufficient conditions on the channel memory, and transmission cost so that the optimal transmission scheduling policy is a monotonically increasing function of the buffer occupancy.
Journal ArticleDOI

A Dynamic Principal-Agent Model with Hidden Information: Sequential Optimality Through Truthful State Revelation

TL;DR: In this paper, a general framework for a large class of multi-period principal-agent problems is proposed, where a principal has a primary stake in the performance of a system but delegates its control to an agent.
Journal ArticleDOI

Joint replenishment and pricing decisions in inventory systems with stochastically dependent supply capacity

TL;DR: This paper generalizes the work of Federgruen and Zipkin on joint optimization of replenishment and pricing with unlimited supply capacity and shows that the optimal inventory control policy is of the modified base- stock type and the base-stock level is decreasing in the available capacity of the current period.
Journal ArticleDOI

Optimal maintenance policies in random environments

TL;DR: In this article, the authors consider an attractive model where the underlying environmental process has a somewhat general semi-Markov structure and show that the control-limit type intrinsic age replacement and repair policies are still optimal.
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)