Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-30T20:33:25.687Z Has data issue: false hasContentIssue false
  • English
  • Français

A simple proof of Whittle's bridging condition in dynamic programming

Published online by Cambridge University Press:  14 July 2016

Roger Hartley
Roger Hartley*
Affiliation:
University of Manchester
*
∗Postal address: Department of Decision Theory, University of Manchester, Manchester M13 9PL, U.K.
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

MARKOV DECISION PROCESSESDYNAMIC PROGRAMMING
Type
Short Communications
Information
Journal of Applied Probability , Volume 17 , Issue 4 , December 1980 , pp. 1114 - 1116
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Hinderer, K. (1970) Foundations of Non-Stationary Dynamic Programming with Discrete Time Parameter. Springer-Verlag, Berlin.CrossRefGoogle Scholar
[2] Whittle, P. (1979) A simple condition for regularity in negative programming. J Appl. Prob. 16, 305–318.CrossRefGoogle Scholar