1
This course is an introduction to the theory and application of large-scale dynamic programming.
FREE
This course includes
Hours of videos
583 years, 3 months
Units & Quizzes
21
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
Topics include Markov decision processes, dynamic programming algorithms, simulation-based algorithms, theory and algorithms for value function approximation, and policy search methods. The course examines games and applications in areas such as dynamic resource allocation, finance and queueing networks.
Course Currilcum
- Markov Decision Processes Unlimited
- Value Iteration Unlimited
- Policy Iteration Unlimited
- Average-Cost Problems Unlimited
- Average-Cost Problems Computational Methods Unlimited
- Application of Value Iteration to Optimization of Multiclass Queueing Networks Unlimited
- Q-Learning Unlimited
- The ODE Method Unlimited
- Exploration versus Exploitation Unlimited
- Introduction to Value Function Approximation Curse of Dimensionality Unlimited
- Model Selection and Complexity Unlimited
- Introduction to Value Function Approximation Algorithms Unlimited
- Temporal-Difference Learning with Value Function Approximation Unlimited
- Temporal-Difference Learning with Value Function Approximation (cont.) Unlimited
- Optimal Stopping Problems Unlimited
- Approximate Linear Programming Unlimited
- Approximate Linear Programming (cont.) Unlimited
- Efficient Solutions for Approximate Linear Programming Unlimited
- Efficient Solutions for Approximate Linear Programming: Factored MDPs Unlimited
- Policy Search Methods Unlimited
- Policy Search Methods (cont.) Unlimited
