No CrossRef data available.
Article contents
On ∊-optimal plans for a non-stationary dynamic programming model with general total reward function
Published online by Cambridge University Press: 01 July 2016
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0001867800030299/resource/name/firstPage-S0001867800030299a.jpg)
- Type
- II. Contributed Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1978
References
Brown, L. D. and Purves, R. (1973) Measurable selections of extrema. Ann. Statist.
1, 902–912.CrossRefGoogle Scholar
Dubins, L. E. and Sudderth, W. D. (1977) Persistently ∊-optimal strategies. Maths Opns. Res.
2, 125–134.Google Scholar
Kertz, R. P. and Nachman, D. C. (1977) Optimal plans for discrete-time non-stationary dynamic programming with general total reward function I: the topology of weak convergence case. Technical Report, Georgia Institute of Technology, Atlanta.Google Scholar