Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 429-434 |
| Number of pages | 6 |
| Journal | International Journal of Economic Theory |
| Volume | 11 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 2015 |
Keywords
- Bellman equation
- Dynamic programming
- Fixed point
- Value function
ASJC Scopus subject areas
- Economics and Econometrics
Fingerprint
Dive into the research topics of 'An application of Kleene's fixed point theorem to dynamic programming'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS