In this paper we use the recursive saddle point method developed by Marcet and Marimon (1999, 2011) to a simple concave dynamic optimization problem. While the recursive saddle point problem is well dened and delivers the correct value of our optimization problem, it does not generate only optimal policies. Indeed some of the solutions that it produces are either suboptimal or do not even satisfy feasibility. We identify the reasons underlying this failure and discuss its implications for some existing applications.
On the recursive saddle point method
MESSNER, MATTHIAS;PAVONI, NICOLA
2016
Abstract
In this paper we use the recursive saddle point method developed by Marcet and Marimon (1999, 2011) to a simple concave dynamic optimization problem. While the recursive saddle point problem is well dened and delivers the correct value of our optimization problem, it does not generate only optimal policies. Indeed some of the solutions that it produces are either suboptimal or do not even satisfy feasibility. We identify the reasons underlying this failure and discuss its implications for some existing applications.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
acceptance-letter.pdf
non disponibili
Tipologia:
Altro materiale allegato
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
196.86 kB
Formato
Adobe PDF
|
196.86 kB | Adobe PDF | Visualizza/Apri |
Note-recursive-saddle-point-method-2014.pdf
non disponibili
Tipologia:
Documento in Pre-print (Pre-print document)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
318.35 kB
Formato
Adobe PDF
|
318.35 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.