Dynamic programming and the recursive principle Flashcards
1
Q
Assumption 1
A
2
Q
The principle of optimality
A
3
Q
Principle of Optimality II
A
This describes sufficient (but not necessary) conditions for a solution.
4
Q
Assumption finite returns
A
5
Q
Corollary
A
Principle of optimality with finite returns
6
Q
Contraction mapping
A
7
Q
Contraction mapping theorem
A
8
Q
Assumption 2
A
9
Q
Results on the Bellman equation
A
10
Q
Theorem Bellman Equation
A
11
Q
Properties of the value function
A
12
Q
Euler and transversality
A
13
Q
Assumption 3
A
