Nathan Huntley
Dynamic Programming and Subtree Perfectness for Deterministic Discrete-Time Systems with Uncertain Rewards
Huntley, Nathan; Troffaes, Matthias C.M.
Authors
Professor Matthias Troffaes matthias.troffaes@durham.ac.uk
Professor
Contributors
Frank Coolen
Editor
Gert de Cooman
Editor
Thomas Fetz
Editor
Michael Oberguggenberger
Editor
Citation
Huntley, N., & Troffaes, M. C. (2011). Dynamic Programming and Subtree Perfectness for Deterministic Discrete-Time Systems with Uncertain Rewards. In F. Coolen, G. de Cooman, T. Fetz, & M. Oberguggenberger (Eds.),
| Conference Name | 7th International Symposium on Imprecise Probability: Theories and Applications |
|---|---|
| Conference Location | Innsbruck |
| Publication Date | 2011 |
| Deposit Date | Feb 21, 2011 |
| Pages | 209-218 |
| Public URL | https://durham-repository.worktribe.com/output/1159386 |
| Publisher URL | http://www.sipta.org/isipta11/index.php?id=paper&paper=026.html |
You might also like
Regret-based budgeted decision rules under severe uncertainty
(2024)
Journal Article
A nonstandard approach to stochastic processes under probability bounding
(2023)
Conference Proceeding
A constructive theory for conditional lower previsions only using rational valued probability mass functions with finite support
(2023)
Presentation / Conference
Using probability bounding to improve decision making for offshore wind planning in industry
(2023)
Presentation / Conference
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search