Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143042 | Operations Research Letters | 2012 | 6 Pages |
Abstract
We consider an example by Haviv (1996) [10] of a constrained Markov decision process that, in some sense, violates Bellman’s principle. We resolve this issue by showing how to preserve a form of Bellman’s principle that accounts for a change of constraint at states that are reachable from the initial state.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Edwin K.P. Chong, Scott A. Miller, Jason Adaska,