TY - JOUR
T1 - An algorithm for excluding redundant assessments in a multiattribute utility problem
AU - Abdildin, Yerkin G.
AU - Abbas, Ali E.
N1 - Funding Information:
This work is supported in part by the National Science Foundation CAREER award NSF-DRMS 0846417. We would like to thank the anonymous reviewers for their helpful comments.
PY - 2012
Y1 - 2012
N2 - The construction of a multiattribute utility function (MUF) is a fundamental step in decision analysis and can be a difficult task to perform unless some decomposition of the utility function is performed. When partial utility independence conditions exist, the functional form is decomposed into a number of lower-order utility assessments. Often the functional form, resulting from such independence conditions, includes duplicate and redundant assessments. This paper introduces a twos-complement exclusion algorithm for determining the minimal set of utility assessments required for a MUF with partial utility independence. The algorithm uses a ternary matrix representation of utility assessments. A comparison with a "brute-force" approach is also provided.
AB - The construction of a multiattribute utility function (MUF) is a fundamental step in decision analysis and can be a difficult task to perform unless some decomposition of the utility function is performed. When partial utility independence conditions exist, the functional form is decomposed into a number of lower-order utility assessments. Often the functional form, resulting from such independence conditions, includes duplicate and redundant assessments. This paper introduces a twos-complement exclusion algorithm for determining the minimal set of utility assessments required for a MUF with partial utility independence. The algorithm uses a ternary matrix representation of utility assessments. A comparison with a "brute-force" approach is also provided.
KW - Deletion
KW - Elimination
KW - Exclusion algorithm
KW - Removing duplicate and redundant utility assessments
KW - Ternary matrix representation
UR - http://www.scopus.com/inward/record.url?scp=84896958868&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896958868&partnerID=8YFLogxK
U2 - 10.1016/j.procs.2012.04.086
DO - 10.1016/j.procs.2012.04.086
M3 - Conference article
AN - SCOPUS:84896958868
VL - 9
SP - 802
EP - 811
JO - Procedia Computer Science
JF - Procedia Computer Science
SN - 1877-0509
T2 - 12th Annual International Conference on Computational Science, ICCS 2012
Y2 - 4 June 2012 through 6 June 2012
ER -