Entropy-optimal weight constraint elicitation with additive multi-attribute utility models
Gert van Valkenhoef and
Omega, 2016, vol. 64, issue C, pages 1-12
We consider the elicitation of incomplete preference information for the additive utility model in terms of linear constraints on the weights. Eliciting incomplete preferences using holistic pair-wise judgments is convenient for the decision maker, but selecting the best pair-wise comparison is difficult. We propose a framework for comparing holistic preference elicitation questions based on their expected information gain, and introduce a procedure for approximating the optimal question. We extend the basic approach to generate reference alternatives that differ on only a few attributes, and to determine when further preference information is unlikely to reduce decision uncertainty. We present results from computational experiments that assess the performance of the procedure and assess the impact of limiting the number of attributes on which the reference alternatives differ. The tests show that the proposed method performs well, and when implemented in a decision support system it may substantially improve on-line elicitation using pair-wise comparisons.
Keywords: Multicriteria; Decision making/process; Probability; Information theory (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: http://EconPapers.repec.org/RePEc:eee:jomega:v:64:y:2016:i:c:p:1-12
Ordering information: This journal article can be ordered from
https://shop.elsevie ... _01_ooc_1&version=01
Access Statistics for this article
Omega is currently edited by B. Lev
More articles in Omega from Elsevier
Series data maintained by Dana Niculescu ().