Non-Convexities in Dynamic Programming Problems

We study the properties of models where agents choose over non-convex budget sets due to extensive margin decisions and  fixed costs.

LINK TO DRAFT (PDF)

Abstract. Models where agents choose over non-convex budget sets are commonly used in the analysis of economic problems with extensive margin decisions and  fixed costs. Their solutions have interesting and distinctive features that are especially relevant in quantitative applications.  We describe how problems with non-convex choice sets differ from standard problems and investigate under which circumstances the inclusion of random shocks makes their solution identical to the solution of standard problems. A simple framework is provided for the analysis of these problems and a numerical example is illustrated.

Citation

@article{gallipoli2008non,
  title={Non-convexities in dynamic programming problems},
  author={Gallipoli, Giovanni and Nesheim, Lars},
  year={2013}
}