Abstract
In Chapter 9 we presented graphical languages for modeling decision problems. The languages ease the burden of specifying the problem and transfer the complexity of the problem to the computer. For problems with a finite time horizon, the computer may fold out the specification to a decision tree and determine an optimal strategy by averaging out and folding back as described in Section 9.3.3. However, the calculations may be intractable, and in this chapter we present alternative methods exploiting symmetries in the decision problem. Sections 10.1–10.3 are devoted to solution methods for influence diagrams. Section 10.4 presents a method for solving unconstrained influence diagrams. In Section 10.5 we consider decision theoretic troubleshooting, which has next to no temporal ordering, and for which the decision trees tend to be intractably large. In Section 10.6 we present two methods for solving MDPs, and a method for solving POMDPs is indicated. The last section presents LIMIDs, which is a way of approximating influence diagrams by limiting the memory of the decision maker.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Rights and permissions
Copyright information
© 2007 Springer Science +Business Media, LLC
About this chapter
Cite this chapter
(2007). Solution Methods for Decision Graphs. In: Bayesian Networks and Decision Graphs. Information Science and Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68282-2_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-68282-2_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-68281-5
Online ISBN: 978-0-387-68282-2
eBook Packages: Computer ScienceComputer Science (R0)