An algorithm for excluding redundant assessments in a multiattribute utility problem

Yerkin G. Abdildin, Ali E. Abbas

Research output: Contribution to journalConference article

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)802-811
Number of pages10
JournalProcedia Computer Science
Volume9
DOIs
Publication statusPublished - Jan 1 2012
Event12th Annual International Conference on Computational Science, ICCS 2012 - Omaha, NB, United States
Duration: Jun 4 2012Jun 6 2012

Keywords

  • Deletion
  • Elimination
  • Exclusion algorithm
  • Removing duplicate and redundant utility assessments
  • Ternary matrix representation

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'An algorithm for excluding redundant assessments in a multiattribute utility problem'. Together they form a unique fingerprint.

  • Cite this