Abstract
In a recent paper, Lippman presents sufficient conditions for Denardo's N-stage contraction in discounted semi-Markov decision processes with unbounded rewards. In this note it is demonstrated that Lippman's conditions may be replaced by weaker conditions which even imply 1-stage contraction. The verification of the conditions of this note is somewhat easier.
| Original language | English |
|---|---|
| Pages (from-to) | 576-580 |
| Number of pages | 6 |
| Journal | Management Science |
| Volume | 24 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1978 |
Fingerprint
Dive into the research topics of 'A note on dynamic programming with unbounded rewards'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver