On the Recursive Saddle Point Method
IGIER Working Paper No. 255
20 Pages Posted: 22 Feb 2004
Date Written: February 2004
Abstract
In this paper a simple dynamic optimization problem is solved with the help of the recursive saddle point method developed by Marcet and Marimon (1999). According to Marcet and Marimon, their technique should yield a full characterization of the set of solutions for this problem. We show though, that while their method allows us to calculate the true value of the optimization program, not all solutions with it admits are correct. Indeed, some of the policies which it generates as solutions to our problem, are either suboptimal or do not even satisfy feasibility. We identify the reasons underlying this failure and discuss its implications for the numerous existing applications.
Keywords: Recursive saddle point, recursive contracts, dynamic programming
JEL Classification: C61, C63
Suggested Citation: Suggested Citation
Do you have a job opening that you would like to promote on SSRN?
Recommended Papers
-
On the Evolution of the Firm Size Distribution: Facts and Theory
By Luis M. B. Cabral and José Mata
-
The Information Technology Revolution and the Stock Market: Evidence
By Bart Hobijn and Boyan Jovanovic
-
Aggregate Consequences of Limited Contract Enforceability
By Thomas F. Cooley, Ramon Marimon, ...
-
Aggregate Consequences of Limited Contract Enforceability
By Thomas F. Cooley, Ramon Marimon, ...
-
Aggregate Consequences of Limited Contract Enforceability
By Thomas F. Cooley, Vincenzo Quadrini, ...
-
The it Revolution and the Stock Market
By Jeremy Greenwood and Boyan Jovanovic
-
The it Revolution and the Stock Market
By Jeremy Greenwood and Boyan Jovanovic