"If you don't do the best with what you happen to have got, you'll never do the best you might have done with what you should have had." (Aris, R., Discrete Dynamic Programming. Waltham, MA, Blaisdell, 1964)

Tv = v A fixed point!

Notes on Dynamic Programming dynamicprogramming.pdf

Notes on Linear-Quadratic Regulator Problem LQ.pdf

Notes on Discrete Dynamic Programming Discrete_Finite_DP

Notes on Stochastic Dynamic Programming dynamicprogramming2.pdf

Notes on Markov Chains markov.pdf

Notes on Recursive Competitive Equilibrium RCE.pdf

Notes on Pareto Optima with Recursive Preferences lucasstokey.pdf

Note on Policy Iteration with Constraints rendahl.pdf

Homework 1 Homework 1

Homework 1 Solutions

Homework 2 Homework 2

Homework 2 Solutions

Homework 3 Homework 3

Program for Basic Finite State-Space Method Discrete.m

Homework 3 Solutions

Program for Solution Solution

Homework 4 Homework 4

Homework 4 Solutions

Homework 5

Homework 5

Homework 5 Solutions

Programs for Solution Main Program

Utility Function

Exam, Spring 2009

Spring 2009 Exam