Video details loadedContinue
HomeMIT 6.262 Discrete Stochastic Processes, Spring 2011Lecture 9: Markov Rewards and Dynamic Programming
MIT 6.262 Discrete Stochastic Processes, Spring 2011
Video 9 of 10
Lecture 9: Markov Rewards and Dynamic Programming
1:23:36
Up Next
Lecture 10: Renewals and the Strong Law of Large Numbers
Description: This lecture covers rewards for Markov chains, expected first passage time, and aggregate rewards with a final reward. The professor then moves on to discuss dynamic programming and the dynamic programming algorithm.
Instructor: Prof. Robert Gallager