Dynamic Programming: Finite States
Dynamic programming (DP) is a sub-field of optimization concerned with sequential decision making over time. The essential ideas of DP have been adopted in many applications, from robotics and AI to the sequencing of DNA. It is used around the world to control aircraft, route shipping, test products, recommend information on media platforms and solve major research problems. Dynamic Programming: Finite States treats the theory of dynamic programming and its applications in economics, finance, and operations research. It contains classical results on dynamic programming as well as extensions created by researchers and practitioners as they wrestle with formulating and solving dynamic models that can explain patterns observed in data. Adopting an abstract framework that provides great generality, this book facilitates rapid progress to the research frontier by combining rigorous theory with numerous applications, many solved exercises, and detailed open-source computer code.
1147454872
Dynamic Programming: Finite States
Dynamic programming (DP) is a sub-field of optimization concerned with sequential decision making over time. The essential ideas of DP have been adopted in many applications, from robotics and AI to the sequencing of DNA. It is used around the world to control aircraft, route shipping, test products, recommend information on media platforms and solve major research problems. Dynamic Programming: Finite States treats the theory of dynamic programming and its applications in economics, finance, and operations research. It contains classical results on dynamic programming as well as extensions created by researchers and practitioners as they wrestle with formulating and solving dynamic models that can explain patterns observed in data. Adopting an abstract framework that provides great generality, this book facilitates rapid progress to the research frontier by combining rigorous theory with numerous applications, many solved exercises, and detailed open-source computer code.
46.99 In Stock
Dynamic Programming: Finite States

Dynamic Programming: Finite States

Dynamic Programming: Finite States

Dynamic Programming: Finite States

Overview

Dynamic programming (DP) is a sub-field of optimization concerned with sequential decision making over time. The essential ideas of DP have been adopted in many applications, from robotics and AI to the sequencing of DNA. It is used around the world to control aircraft, route shipping, test products, recommend information on media platforms and solve major research problems. Dynamic Programming: Finite States treats the theory of dynamic programming and its applications in economics, finance, and operations research. It contains classical results on dynamic programming as well as extensions created by researchers and practitioners as they wrestle with formulating and solving dynamic models that can explain patterns observed in data. Adopting an abstract framework that provides great generality, this book facilitates rapid progress to the research frontier by combining rigorous theory with numerous applications, many solved exercises, and detailed open-source computer code.

Product Details

ISBN-13: 9781009540759
Publisher: Cambridge University Press
Publication date: 07/31/2025
Pages: 384
Product dimensions: 6.00(w) x 1.25(h) x 9.00(d)

About the Author

Thomas J. Sargent is a Nobel prize winning economist and Professor of Economics at NYU. He has held positions at Stanford, Minnesota, Chicago, and Princeton, and served as President of the Econometric Society and of the American Economic Association. He is renowned for his influential research on macroeconomics, rational expectations, and policy analysis.

John Stachurski is a Professor at the Australian National University specializing in mathematical and computational economics. As an economist he has made influential contributions to the study of Markov models and dynamic optimization. He is also a co-founder of QuantEcon, a popular platform for open source economic modelling.

Table of Contents

1. Introduction; 2. Operators and Fixed Points; 3. Markov Dynamics; 4. Optimal Stopping; 5. Markov Decision Processes; 6. Stochastic Discounting; 7. Nonlinear Valuation; 8. Recursive Decision Processes; 9. Abstract Dynamic Programming; 10; Continuous Time.
From the B&N Reads Blog
Page 1 of

Customer Reviews