A Comparison of Graphical Techniques for Asymmetric Decision Problems

Bielza, Concha; Shenoy, Prakash P.
November 1999
Management Science;Nov99, Vol. 45 Issue 11, p1552
Academic Journal
We compare four graphical techniques for representation and solution of asymmetric decision problems--decision trees, influence diagrams, valuation networks, and sequential decision diagrams. We solve a modified version of Covaliu and Oliver's Reactor problem using each of the four techniques. For each technique, we highlight the strengths, weaknesses, and some open issues that perhaps can be resolved with further research.


Related Articles

  • Structuring conditional relationships in influence diagrams. Smith, James E.; Holtzman, Samuel; Matheson, James E. // Operations Research;Mar/Apr93, Vol. 41 Issue 2, p280 

    An influence diagram is a graphical representation of a decision problem that is at once a formal description of a decision problem that can be treated by computers and a representation that is easily understood by decision makers who may be unskilled in the art of complex probabilistic...

  • Combining morphological analysis and Bayesian networks for strategic decision support. de Waal, A.; Ritchey, T. // Orion;2007, Vol. 23 Issue 2, p105 

    Morphological analysis (MA) and Bayesian networks (BN) are two closely related modelling methods, each of which has its advantages and disadvantages for strategic decision support modelling. MA is a method for defining, linking and evaluating problem spaces. BNs are graphical models which...

  • Representation and solution of decision problems using sequential decision diagrams. Covaliu, Zvi; Oliver, Robert M. // Management Science;Dec1995, Vol. 41 Issue 12, p1860 

    In this paper we introduce a new graph, the sequential decision diagram, to aid in modeling, formulation, and solution of sequential decision problems under uncertainty. While as compact as an influence diagram, the sequential diagram captures the asymmetric and sequential aspects of decision...

  • A New Type Of Node Split Rule For Decision Tree Learning. Reddy, C. Sudarsana; Vasu, V.; Kumara Swamy Achari, B. // International Journal of Advanced Research in Computer Science;May/Jun2013, Vol. 4 Issue 3, p75 

    A new type of node split rule for decision tree learning is proposed. This new type of node splitting rule is named as Sudarsana Reddy Node Split Rule (SRNSR). SRNSR is very easy to compute. It involves only finding the sum of logarithmic values of non-zero class counts of values of each...

  • Generating Scenario Trees for Multistage Decision Problems. Kjetil H√łyland; Wallace, Stein W. // Management Science;Feb2001, Vol. 47 Issue 2, p295 

    In models of decision making under uncertainty we often are faced with the problem of representing the uncertainties in a form suitable for quantitative models. If the uncertainties are expressed in terms of multivariate continuous distributions, or a discrete distribution with far too many...

  • When a Degree Sequence Represents a Tree Sequence. Naskar, Saptarshi; Basuli, Krishnendu; Sen Sarma, Samar // ICFAI Journal of Computer Sciences;2008, Vol. 2 Issue 3, p62 

    A sequence of nonnegative integers can represent degrees of a graph. This conclusion is true when there is an already established condition. The sequence called graphic sequence may represent a tree. The objective of this paper is to show that a similar sequence represents the degrees of...

  • Supporting Negotiations over Influence Diagrams. Rios, Jesus; Insua, David Rios // Decision Analysis;Sep2009, Vol. 6 Issue 3, p153 

    We deal with issues concerning negotiation support for group decisions over influence diagrams, when the group members disagree about utility and probability assessments. We base our discussion on a modification of the balanced increment solution, which guarantees a final negotiated Pareto...

  • Formulating Asymmetric Decision Problems as Decision Circuits. Bhattacharjya, Debarun; Shachter, Ross D. // Decision Analysis;Jun2012, Vol. 9 Issue 2, p138 

    Decision analysis problems have traditionally been solved using either decision trees or influence diagrams. Although decision trees are better at handling asymmetry, prevalent in many reliability and risk analysis problems, influence diagrams can solve larger real-world problems by exploiting...

  • A framework for Satisfiability Modulo Theories. Kroening, Daniel; Strichman, Ofer // Formal Aspects of Computing;Oct2009, Vol. 21 Issue 5, p485 

    We present a unifying framework for understanding and developing SAT-based decision procedures for Satisfiability Modulo Theories (SMT). The framework is based on a reduction of the decision problem to propositional logic by means of a deductive system. The two commonly used techniques, eager...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics