Article contents
A simple proof of Whittle's bridging condition in dynamic programming
Published online by Cambridge University Press: 14 July 2016
Abstract
We offer a short proof that the bridging condition introduced by Whittle is sufficient for regularity in negative dynamic programming. We exploit concavity of the optimal value operator and do not need a special treatment of the case when optimal policies do not exist.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust
References
- 5
- Cited by