Jesus Marin Solano Jorge Navas Rodenes (Universitat de Barcelona)
Abstract
This paper derives the HJB (Hamilton-Jacobi-Bellman) equation for sophisticated agents in a finite horizon dynamic optimization problem with non-constant discounting in a continuous setting, by using a dynamic programming approach. A simple example is used in order to illustrate the applicability of this HJB equation, by suggesting a method for constructing the subgame perfect equilibrium solution to the problem. Conditions for the observational equivalence with an associated problem with constant discounting are analyzed. Special attention is paid to the case of free terminal time. Strotzs model (an eating cake problem of a nonrenewable resource with non-constant discounting) is revisited.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Universitat de Barcelona. Espai de Recerca en Economia in its series Working Papers in Economics with number
183.
Length: 29 pages Date of creation: 2007 Date of revision: Handle: RePEc:bar:bedcje:2007183
Contact details of provider: Postal: Espai de Recerca en Economia, Facultat de Ciències Econòmiques. Tinent Coronel Valenzuela, Num 1-11 08034 Barcelona. Spain. Web page: http://www.ere.ub.es More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Espai de Recerca en Economia).
Related research
Keywords:
Find related papers by JEL classification: C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search, Learning, and Information C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports: