
handle: 11565/3960720
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.
dynamic programming, recursive saddle point, Macroeconomic theory (monetary models, models of taxation), RECURSIVE SADDLE POINT, RECURSIVE CONTRACTS, DYNAMIC PROGRAMMING, Dynamic programming, Resource and cost allocation (including fair division, apportionment, etc.), recursive contracts
dynamic programming, recursive saddle point, Macroeconomic theory (monetary models, models of taxation), RECURSIVE SADDLE POINT, RECURSIVE CONTRACTS, DYNAMIC PROGRAMMING, Dynamic programming, Resource and cost allocation (including fair division, apportionment, etc.), recursive contracts
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
