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

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

TL;DR: Lower bounds for Random-Edge and Random-Facet lower bounds for randomized pivoting rules were known before only in abstract settings, and not for concrete linear programs.
Journal ArticleDOI

Managing Response Time in a Call-Routing Problem with Service Failure

TL;DR: In this paper, a routing problem in a system where customers call back when their problems are not completely resolved by the customer service representatives (CSRs) is analyzed, and the concept of call resolution probability constitutes a good proxy for call quality.
Journal Article

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

TL;DR: In this paper, the authors consider MDPs with multiple limit-average (or mean-payoff) functions and show that both randomization and memory are necessary for strategies, and that finite-memory randomized strategies are sufficient.
Journal ArticleDOI

Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model

TL;DR: Comparing the expected revenues from the assortments obtained by the 4-approximation algorithm with the upper bounds on the optimal expected revenues, the numerical results indicate that the 4.approximate solution to assortment optimization problems is likely to be the optimal assortment.
Proceedings ArticleDOI

Efficiency and nash equilibria in a scrip system for P2P networks

TL;DR: A model of providing service in a P2P network is analyzed and it is shown that by adding a scrip system, a mechanism that admits a reasonable Nash equilibrium that reduces free riding can be obtained.
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)