A Note on Dynamic Programming with Unbounded Rewards
January 1978
Article
volume 24, issue 5 pp 576-580.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ANoteOnDynamic[1].pdf, 0.3MB) |
|
Redirect to Permalink
(Permalink.url.txt, 84 bytes) |
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 l-stage contraction. The verification of the conditions of this note is somewhat easier.
Keywords
- decision making
- mathematical models
- management science
- dynamic programming
- decision theory
- Markov processing
- contraction operations
- mathematical anlysis
Automatically Extracted Terms
- condition
- contraction
- lippman
- function
- space
- reward
- respect
- markov decision processes
- supremum norm
- supremum
- process
- number
- decision
- supremum norms
- state x e
- stage
- semi-markov decision processes
- operator
- one-stage contraction
- markov
