Lecture 9: Markov Rewards and Dynamic Programming  thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Lecture 9: Markov Rewards and Dynamic Programming

Published on Feb 11, 20132394 Views

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 progra

Related categories