Cake eating problem
We can solve the problem as a dynamic programming problem. With
utility functionrt(ct)$βt ^1 u(ct)and transition function
f(w,c)$w c.The Bellman equation is
Vt(w) = max
c 2 [ 0 ,w]
We can solve the problem as a dynamic programming problem. With
utility functionrt(ct)$βt ^1 u(ct)and transition function
f(w,c)$w c.The Bellman equation is
Vt(w) = max
c 2 [ 0 ,w]