A class of intertemporal optimization models characterized by a recursive objective
functional obtained as the limit of iterations of the Koopmans aggregator is considered.
We focus on negative dynamic programming problems in which aggregators may be un-
bounded from below and establish existence of an optimal solution under the assumption
of strong concavity for the aggregator, both in the deterministic and in the stochastic settings.
Premi sulle icone a fianco dei nomi per visualizzare i libri scritti dall'autore