E-Book, Englisch, 684 Seiten, E-Book
Puterman Markov Decision Processes
1. Auflage 2014
ISBN: 978-1-118-62587-3
Verlag: John Wiley & Sons
Format: EPUB
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
Discrete Stochastic Dynamic Programming
E-Book, Englisch, 684 Seiten, E-Book
Reihe: Wiley Series in Probability and Statistics
ISBN: 978-1-118-62587-3
Verlag: John Wiley & Sons
Format: EPUB
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
The Wiley-Interscience Paperback Series consists of selected booksthat have been made more accessible to consumers in an effort toincrease global appeal and general circulation. With these newunabridged softcover volumes, Wiley hopes to extend the lives ofthese works by making them available to future generations ofstatisticians, mathematicians, and scientists.
"This text is unique in bringing together so many resultshitherto found only in part in other texts and papers. . . . Thetext is fairly self-contained, inclusive of some basic mathematicalresults needed, and provides a rich diet of examples, applications,and exercises. The bibliographical material at the end of eachchapter is excellent, not only from a historical perspective, butbecause it is valuable for researchers in acquiring a goodperspective of the MDP research potential."
--Zentralblatt fur Mathematik
". . . it is of great value to advanced-level students,researchers, and professional practitioners of this field to havenow a complete volume (with more than 600 pages) devoted to thistopic. . . . Markov Decision Processes: Discrete Stochastic DynamicProgramming represents an up-to-date, unified, and rigoroustreatment of theoretical and computational aspects of discrete-timeMarkov decision processes."
--Journal of the American Statistical Association
Autoren/Hrsg.
Weitere Infos & Material
Preface.
1. Introduction.
2. Model Formulation.
3. Examples.
4. Finite-Horizon Markov Decision Processes.
5. Infinite-Horizon Models: Foundations.
6. Discounted Markov Decision Problems.
7. The Expected Total-Reward. Criterion.
8. Average Reward and Related Criteria.
9. The Average Reward Criterion-Multichain and CommunicatingModels.
10. Sensitive Discount Optimality.
11. Continuous-Time Models.
Afterword.
Notation.
Appendix A. Markov Chains.
Appendix B. Semicontinuous Functions.
Appendix C. Normed Linear Spaces.
Appendix D. Linear Programming.
Bibliography.
Index.