Video Lectures

Lecture 9: Markov Rewards and Dynamic Programming

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

Transcript
Lecture Slides
Markov Rewards and Dynamic Programming ( PDF)

Course Info

Learning Resource Types

assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
menu_book Online Textbook
theaters Lecture Videos