Recursive Utility and the Solution to the Bellman Equation
Additional contact information
Masayuki Yao: Research Associate (Non-tenured), Department of Economics, Keio University
No DP2016-08, Discussion Paper Series from Research Institute for Economics & Business Administration, Kobe University
This study infinite-horizon deterministic dynamic programming problems based on recursive utility in discrete time. Under a small number of conditions, we show that the Bellman operator has a fixed point using Knaster-Tarski's fixed point theorem. We also show the fixed point of the Bellman operator can be computed by iteration from the initial function between the lower boundary and the fixed point. To show the convergence theorem, we use Tarski-Kantorovitch's fixed point theorem.
Keywords: Recursive utility; Fixed point theorem; Dynamic programming; Bellman equation (search for similar items in EconPapers)
JEL-codes: C61 O41 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-dge, nep-gro and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
http://www.rieb.kobe-u.ac.jp/academic/ra/dp/English/DP2016-08.pdf First version, 2016 (application/pdf)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: http://EconPapers.repec.org/RePEc:kob:dpaper:dp2016-08
Access Statistics for this paper
More papers in Discussion Paper Series from Research Institute for Economics & Business Administration, Kobe University 2-1 Rokkodai, Nada, Kobe 657-8501 JAPAN. Contact information at EDIRC.
Series data maintained by Office of Promoting Research Collaboration, Research Institute for Economics & Business Administration, Kobe University ().