Dynamic decision networks: an alternative to dynamic programming
by Gerald C. Kobylski, Dennis M. Buede
International Journal of Information and Decision Sciences (IJIDS), Vol. 3, No. 3, 2011

Abstract: This paper explores the validity and usefulness of dynamic decision networks (DDNs) in approximating dynamic programming (DP). An approach for comparing the optimal policies of the DDNs and DP was developed and utilised to determine how well DDNs perform under different conditions. Computation times were also compared to determine if the time the DDN saves was worth any inaccuracy obtained. It was found that DDNs are exponentially faster than DP. However, an increase in the values of some of the parameters investigated, such as the number of time slices and objectives, improved the DDN's computational time advantage but reduced its ability to approximate DP optimal policies. A significant finding of this research concerned how close the expected values of the DDN optimal policies were to those of DP in the cases examined. It is shown that in the cases studies, when the DDN's optimal policies disagreed with the DP optimal policies, the expected values of the policies selected by the DDN were always quite close to those of DP. Thus, the DDN appears to be a very useful approximation technique for DP because of its accuracy and efficiency.

Online publication date: Thu, 30-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com