Skip to main content

Decomposition of Influence Diagrams

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2143))

Abstract

When solving a decision problem we want to determine an optimal policy for the decision variables of interest. A policy for a decision variable is in principle a function over its past. However, some of the past may be irrelevant and for both communicational as well as computational reasons it is important not to deal with redundant variables in the policies. In this paper we present a method to decompose a decision problem into a collection of smaller sub-problems s.t. a solution (with no redundant variables) to the original decision problem can be found by solving the sub-problems independently. The method is based on an operational characterization of the future variables being relevant for a decision variable, thereby also providing a characterization of those parts of a decision problem that are relevant for a particular decision.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dan Geiger, Thomas Verma, and Judea Pearl. d-separation: From theorems to algorithms. In Uncertainty in Artificial Intelligence 5, 1990.

    Google Scholar 

  2. Eric Horwitch and Matthew Barry. Display of information for time-critical decision making. In Philippe Besnard and Steve Hanks, editors, Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pages 296–305. Morgan Kaufmann Publishers, 1995.

    Google Scholar 

  3. Ronald A. Howard and James E. Matheson. Influence diagrams. In Ronald A. Howard and James E. Matheson, editors, The Principles and Applications of Decision Analysis, volume 2, chapter 37, pages 721–762. Strategic Decision Group, 1981.

    Google Scholar 

  4. Frank Jensen, Finn V. Jensen, and Søren L. Dittmer. From influence diagrams to junction trees. In Ramon Lopez de Mantaras and David Poole, editors, Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, pages 367–373. Morgan Kaufmann Publishers, 1994.

    Google Scholar 

  5. Anders L. Madsen and Finn V. Jensen. Lazy evaluation of symmetric Bayesian decision problems. In Kathryn B. Laskey and Henri Prade, editors, Proceedings of the Fifthteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers, 1999.

    Google Scholar 

  6. Thomas D. Nielsen and Finn V. Jensen. Welldefined decision scenarios. In Kathryn B. Laskey and Henri Prade, editors, Proceedings of the Fifthteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers, 1999.

    Google Scholar 

  7. Thomas D. Nielsen and Finn V. Jensen. Welldefined decision scenarios. Technical Report R-01-5002, Department of Computer Science, Fredrik Bajers 7E, 9220 Aalborg, Denmark, 2001.

    Google Scholar 

  8. Dennis Nilsson and Finn V. Jensen. Probabilities of future decisions. In Information, Uncertainty and Fusion, pages 161–171. Kluwer Academic Publishers, 2000.

    Google Scholar 

  9. Ross D. Shachter. Bayes ball: The rational pastime (for determining irrelevance and requisite information in belief networks and influence diagrams). In Gregory F. Cooper and Serafin Moral, editors, Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pages 480–487. Morgan Kaufmann Publishers, 1998.

    Google Scholar 

  10. Ross D. Shachter. Efficient value of information computation. In Kathryn B. Laskey and Henri Prade, editors, Proceedings of the Fifthteenth Conference on Uncertainty in Artificial Intelligence, pages 594–601. Morgan Kaufmann Publishers, 1999.

    Google Scholar 

  11. Ross D. Shachter. Evaluating influence diagrams. Operations Research Society of America, 34(6):79–90, February 1986.

    Google Scholar 

  12. Ross D. Shachter and Mark A. Peot. Decision making using probabilistic inference methods. In Didier Dubois, Michael P. Wellman, Bruce D’Ambrosio, and Phillipe Smets, editors, Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, pages 276–283. Morgan Kaufmann Publishers, 1992.

    Google Scholar 

  13. Prakash P. Shenoy. Valuation-based systems for Bayesian decision analysis. Operations Research, 40(3):463–484, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. Joseph. A. Tatman and Ross. D. Shachter. Dynamic programming and influence diagrams. IEEE Transactions on Systems, Man and Cybernetics, 20(2):365–379, March/April 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, T.D. (2001). Decomposition of Influence Diagrams. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44652-4_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42464-2

  • Online ISBN: 978-3-540-44652-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics