An application of Kleene's fixed point theorem to dynamic programming
Kevin Reffett and
International Journal of Economic Theory, 2015, vol. 11, issue 4, 429-434
type="main" xml:lang="en"> We show that the least fixed point of the Bellman operator in a certain set can be computed by value iteration whether or not the fixed point is the value function. As an application, we give a simpler proof of one of Kamihigashi's main results.
References: Add references at CitEc
Citations: View citations in EconPapers (5) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:bla:ijethy:v:11:y:2015:i:4:p:429-434
Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=1742-7355
Access Statistics for this article
International Journal of Economic Theory is currently edited by Kazuo Nishimura and Makoto Yano
More articles in International Journal of Economic Theory from The International Society for Economic Theory
Bibliographic data for series maintained by Wiley Content Delivery ().