We study general dynamic programming problems with continuous and discrete choices and general constraints. The value functions may have kinks arising (1) at indifference points between discrete choices and (2) at constraint boundaries. Nevertheless, we establish a general envelope theorem:...

We derive marginal conditions of optimality (i.e., Euler equations) for a general class of Dynamic Discrete Choice (DDC) structural models. These conditions can be used to estimate structural parameters in these models without having to solve for or approximate value functions. This result...

The solution to dynamic portfolio choice models can be formulated in terms of a value function by the Bellman principle of optimality, which reduces the multi-period optimal policy choice problem to a sequence of one-period maximization problems. For two adjacent periods, economists compute the...

This paper extends the Euler Equation (EE) representation of dynamic decision problems to a general class of discrete choice models and shows that the advantages of this approach apply not only to the estimation of structural parameters but also to the solution of the model and the evaluation of...