Entropy methods for adaptive utility elicitation

Authors:
A. E. Abbas
Affiliations:
Dept. of Manage. Sci. & Eng., Stanford Univ., CA, USA
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2004

Citing 0
Cited 4

Bayesian Simulation and Decision Analysis: An Expository Survey

Decision Analysis
Parameterized defuzzification with maximum entropy weighting function-Another view of the weighting function expectation method

Mathematical and Computer Modelling: An International Journal
People, sensors, decisions: Customizable and adaptive technologies for assistance in healthcare

ACM Transactions on Interactive Intelligent Systems (TiiS) - Special issue on highlights of the decade in interactive intelligent systems
Guessing preferences: a new approach to multi-attribute ranking and selection

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an optimal question-selection algorithm to elicit von Neumann and Morgenstern utility values for a set of ordered prospects of a decision situation. The approach uses information theory and entropy-coding principles to select the minimum expected number of questions needed for utility elicitation. At each stage of the questionnaire, we use the question that will provide the largest reduction in the entropy of the joint distribution of the utility values. The algorithm uses questions that require binary responses, which are easier to provide than numeric values, and uses an adaptive question-selection scheme where each new question depends on the previous response obtained from the decision maker. We present a geometric interpretation for utility elicitation and work through a full example to illustrate the approach.