Skip to main content
Book cover

Simulation-based Algorithms for Markov Decision Processes

  • Book
  • © 2007

Overview

  • Provides practical modeling methods for many real-world problems with high dimensionality or complextity which have not hitherto been treatable with Markov decision processes
  • Rigorous theoretical derivation of sampling and population-based algorithms enables the reader to expand on the work presented in the certainty that new results will have a sound foundation
  • First-time assimilation of many recently-developed techniques and results in a form suitable for a broad readership of researchers and students
  • Includes supplementary material: sn.pub/extras

Part of the book series: Communications and Control Engineering (CCE)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 149.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

Keywords

About this book

Often, real-world problems modeled by Markov decision processes (MDPs) are difficult to solve in practise because of the curse of dimensionality. In others, explicit specification of the MDP model parameters is not feasible, but simulation samples are available. For these settings, various sampling and population-based numerical algorithms for computing an optimal solution in terms of a policy and/or value function have been developed recently.

Here, this state-of-the-art research is brought together in a way that makes it accessible to researchers of varying interests and backgrounds. Many specific algorithms, illustrative numerical examples and rigorous theoretical convergence results are provided. The algorithms differ from the successful computational methods for solving MDPs based on neuro-dynamic programming or reinforcement learning. The algorithms can be combined with approximate dynamic programming methods that reduce the size of the state space and ameliorate the effects of dimensionality.

Authors and Affiliations

  • Department of Computer Science and Engineering, Sogang University, Seoul, Republic of Korea

    Hyeong Soo Chang

  • Department of Applied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, USA

    Jiaqiao Hu

  • Smith School of Business and Institute for Systems Research, University of Maryland, College Park, USA

    Michael C. Fu

  • Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, USA

    Steven I. Marcus

About the authors

Steven I. Marcus received his Ph.D. and S.M. from the Massachusetts Institute of Technology in 1975 and 1972, respectively. He received a B.A. from Rice University in 1971. From 1975 to 1991, he was with the Department of Electrical and Computer Engineering at the University of Texas at Austin, where he was the L.B. (Preach) Meaders Professor in Engineering. He was Associate Chairman of the Department during the period 1984-89. In 1991, he joined the University of Maryland, College Park, where he was Director of the Institute for Systems Research until 1996. He is currently a Professor in the Electrical Engineering Department and the Institute for Systems Research.

Steven Marcus is a Fellow of IEEE, and a member of SIAM, AMS, and the Operations Research Society of America. He is an Editor of the SIAM Journal on Control and Optimization, and Associate Editor of Mathematics of Control, Signals, and Systems, Journal on Discrete Event Dynamic Systems, and Acta Applicandae Mathematicae. He has authored or co-authored more than 100 articles, conference proceedings, and book chapters.

Dr. Marcus's research interests lie in the areas of control and systems engineering, analysis and control of stochastic systems, Markov decision processes, stochastic and adaptive control, learning, fault detection, and discrete event systems, with applications in manufacturing, acoustics, and communication networks.

 

Dr. Fu received his Ph.D. and M.S degrees in applied mathematics from Harvard University in 1989 and 1986, respectively. He received S.B. and S.M. degrees in electrical engineering and an S.B. degree in mathematics from the Massachusetts Institute of Technology in 1985. Since 1989, he has been at the University of Maryland, College Park, in the College of Business and Management.

Dr. Fu is a member of IEEE and the Institute for Operations Research and the Management Sciences (INFORMS). He is the Simulation Area Editor for Operations, an Associate Editor for Management Science, and has served on the Editorial Boards of the INFORMS Journal on Computing, Production and Operations Management and IIE Transactions. He was on the program committee for the Spring 1996 INFORMS National Meeting, in charge of contributed papers. In 1995, he received the Maryland Business School's annual Allen J. Krowe Award for Teaching Excellence. He is the co-author (with Jian-Qiang Hu) of the book, Conditional Monte Carlo: Gradient Estimation and Optimization Applications (0-7923-9873-4, 1997), which received the 1998 INFORMS College on Simulation Outstanding Publication Award. Other awards include the 1999 IIE Operations Research Division Award and a 1998 IIE Transactions Best Paper Award. In 2002, he received ISR's Outstanding Systems Engineering Faculty Award.

Dr. Fu's research interests lie in the areas of stochastic derivative estimation and simulation optimization of discrete-event systems, particularly with applications towards manufacturing systems, inventory control, and the pricing of financial derivatives.

Bibliographic Information

Publish with us