Material Detail

Lecture 9: Markov Rewards and Dynamic Programming

Lecture 9: Markov Rewards and Dynamic Programming

This video was recorded at 6.262 Discrete Stochastic Processes. 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.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.