1. Home
  2. MERLOT Materials
  3. Material Detail: Lecture 9: Markov Rewards and Dynamic Programming

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.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

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

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 10, 2015
Date Modified in MERLOT:
February 10, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as Lecture 9: Markov Rewards and Dynamic Programming
People who viewed this also viewed
Other materials like Lecture 9: Markov Rewards and Dynamic Programming

Comments

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