In this paper, which is a continuation of a previous discrete time paper, we develop a theory for continuous time stochastic control problems which, in various ways, are time inconsistent in the sense that they do not admit a Bellman optimality principle. We study these problems within a game...

We study the gap between the state pension provided by the Italian pension system pre-Dini reform and post-Dini reform. The goal is to fill the gap between the old and the new pension by joining a defined contribution pension scheme and adopting an optimal investment strategy that is...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

This paper relates recursive utility in continuous time to its discrete-time origins and provides a rigorous and intuitive alternative to a heuristic approach presented in [Duffie, Epstein 1992], who formally define recursive utility in continuous time via backward stochastic differential...

Banks should evaluate whether a borrower is likely to default. The author applies several techniques in the extensive mathematical literature of stochastic optimal control/dynamic programming to derive an optimal debt in an environment where there are risks on both the asset and liabilities...

Creditors, banks and bank regulators should evaluate whether a borrower is likely to default. I apply several techniques in the extensive mathematical literature of stochastic optimal control/dynamic programming to derive an optimal debt in an environment where there are risks on both the asset...

Policy makers constantly face optimal control problems: what controls allow to achieve certain targets in, e.g., GDP growth or inflation? Conventionally this is done by applying certain linear-quadratic optimization algorithms to dynamic econometric models. Several algorithms extend this...