A new method for tackling asymmetric decision problems
From MaRDI portal
Abstract: Chain Event Graphs are probabilistic graphical models designed especially for the analysis of discrete statistical problems which do not admit a natural product space structure. We show here how they can be used for decision analysis, and describe an optimal decision strategy based on an efficient local computation message passing scheme. We briefly describe a method for producing a parsimonious decision CEG, analogous to the parsimonious ID, and touch upon the CEG-analogues of Shachter's barren node deletion and arc reversal for ID-based solution.
Recommendations
Cites work
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- scientific article; zbMATH DE number 3288322 (Why is no real title available?)
- A Comparison of Graphical Techniques for Asymmetric Decision Problems
- Bayesian decision analysis. Principles and practice.
- Bayesian networks for discrete multivariate data: An algebraic approach to inference
- Causal analysis with chain event graphs
- Causal identifiability via chain event graphs
- Conditional independence and chain event graphs
- Formulating asymmetric decision problems as decision circuits
- Influence diagrams for Bayesian decision analysis
- On SPI-lazy evaluation of influence diagrams
- Refining a Bayesian network using a chain event graph
- Representation and Solution of Decision Problems Using Sequential Decision Diagrams
- Sequential influence diagrams: a unified asymmetry framework
Cited in
(6)
This page was built for publication: A new method for tackling asymmetric decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q110206)