A GRAPHICAL-METHOD FOR SOLVING A DECISION-ANALYSIS PROBLEM

被引:7
作者
GOUTIS, C
机构
[1] Department of Statistical Science, University College London
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1995年 / 25卷 / 08期
关键词
D O I
10.1109/21.398680
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A method for solving multistage decision analysis problems under uncertainty is proposed, The method is appropriate when the utility function can be decomposed to smaller factors and the joint probability function of the random variables also factorises to probabilities defined in smaller subsets of random variables, We use the factorisations and the corresponding graphical structure of the problem to compute efficiently the expected utility at each stage, All computations are local in the sense that they involve a small number of variables, Then, using dynamic programming, we can identify an optimum strategy, depending on the available knowledge at the time that decisions are taken, The algorithm is illustrated by a worked example, and a comparison with existing approaches is included.
引用
收藏
页码:1181 / 1193
页数:13
相关论文
共 21 条
[1]   COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE [J].
ARNBORG, S ;
CORNEIL, DG ;
PROSKUROWSKI, A .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (02) :277-284
[2]  
Berge C, 1973, GRAPHS HYPERGRAPHS, V7
[3]   A COMPARISON OF APPROACHES AND IMPLEMENTATIONS FOR AUTOMATING DECISION-ANALYSIS [J].
CALL, HJ ;
MILLER, WA .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 1990, 30 (1-3) :115-162
[4]   THE COMPUTATIONAL-COMPLEXITY OF PROBABILISTIC INFERENCE USING BAYESIAN BELIEF NETWORKS [J].
COOPER, GF .
ARTIFICIAL INTELLIGENCE, 1990, 42 (2-3) :393-405
[5]  
DeGroot M.H., 2005, OPTIMAL STAT DECISIO
[6]  
EZAWA KJ, 1986, THESIS STANFORD U
[7]  
HOWARD RA, 1984, PRINCIPLES APPLICATI
[8]  
KONG A, 1986, THESIS HARVARD U
[9]  
LAURITZEN SL, 1988, J ROY STAT SOC B MET, V50, P157
[10]  
MILLER AC, 1976, AUTOMATED AIDS DECIS