Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Procedia Computer Science |
| Publisher | Elsevier |
| Pages | 802-811 |
| Number of pages | 10 |
| Volume | 9 |
| DOIs | |
| Publication status | Published - 2012 |
| Externally published | Yes |
| Event | 12th Annual International Conference on Computational Science, ICCS 2012 - Omaha, NB, United States Duration: Jun 4 2012 → Jun 6 2012 |
Other
| Other | 12th Annual International Conference on Computational Science, ICCS 2012 |
|---|---|
| Country | United States |
| City | Omaha, NB |
| Period | 6/4/12 → 6/6/12 |
Fingerprint
Keywords
- Deletion
- Elimination
- Exclusion algorithm
- Removing duplicate and redundant utility assessments
- Ternary matrix representation
ASJC Scopus subject areas
- Computer Science(all)
Cite this
An algorithm for excluding redundant assessments in a multiattribute utility problem. / Abdildin, Yerkin G.; Abbas, Ali E.
Procedia Computer Science. Vol. 9 Elsevier, 2012. p. 802-811.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - An algorithm for excluding redundant assessments in a multiattribute utility problem
AU - Abdildin, Yerkin G.
AU - Abbas, Ali E.
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 contribution
VL - 9
SP - 802
EP - 811
BT - Procedia Computer Science
PB - Elsevier
ER -