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.
Nel rispetto della Direttiva 2009/136/CE, ti informiamo che il nostro sito utilizza i cookies. Se continui a navigare sul sito, accetti espressamente il loro utilizzo.