Math-S401: Lecture I - Introduction

(1:11:30)

Math-S401: Lecture XV - Shortest path problems

(52:14)

Math-S401: Lecture VII - Euler equations

(1:7:23)

Math-S401: Lecture IV - Optimisation

(46:22)

Math-S401: Lecture XIX - Longest common substring, efficient matrix multiplication, egg drop problem

(1:29:44)

Math-S401: Lecture XVI - Currency Exchange problem

(21:46)

Math-S401: Lecture XVII - Subset sum problem

(24:)

Math-S401: Lecture III - Contraction mappings

(50:14)

Math-S401: Lecture IX - Interpolation

(30:59)

Math-S401: Lecture XII - Stochastic dynamic programming

(1:13:27)

Math-S401: Lecture II - Banach spaces

(1:7:16)

Math-S401: Lecture XIV - burglar's problem

(36:43)

Math-S401: Lecture VI - properties of the Bellman equation

(44:58)

Math-S401: Lecture V - The Bellman operator

(1:18:20)

Math-S401: Lecture VIII - Value function iteration

(1:4:20)

Math-S401: Lecture X - Policy function iteration

(45:)

Maths-401: Lecture XI - Tree growth example

(27:)