GAI Networks for Utility Elicitation

This paper deals with preference representation and elicitation in the context of multiattribute utility theory under risk. Assuming the decision maker behaves according to the EU model, we investigate the elicitation of generalized additively decomposable utility functions on a product set (GAI-decomposable utilities). We propose a general elicitation procedure based on a new graphical model called a GAI-network. The latter is used to represent and manage independences between attributes, as junction graphs model independences between random variables in Bayesian networks. It is used to design an elicitation questionnaire based on simple lotteries involving completely specified outcomes. Our elicitation procedure is convenient for any GAI-decomposable utility function, thus enhancing the possibilities offered by UCP-networks.

[1]  Joseph Y. Halpern,et al.  Great Expectations. Part II: Generalized Expected Utility as a Universal Decision Rule , 2003, IJCAI.

[2]  Shlomo Zilberstein,et al.  Great Expectations. Part I: On the Customizability of Generalized Expected Utility , 2003, IJCAI.

[3]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[4]  Glenn Shafer,et al.  Probabilistic expert systems , 1996, CBMS-NSF regional conference series in applied mathematics.

[5]  Ronen I. Brafman,et al.  UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.

[6]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[7]  Ronald A. Howard,et al.  Influence Diagrams , 2005, Decis. Anal..

[8]  Wray L. Buntine.  Operations for Learning with Graphical Models , 1994, J. Artif. Intell. Res..

[9]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[10]  Joseph Y. Halpern,et al.  Great expectations: part I: on the customizability of generalized expected utility , 2003, IJCAI 2003.

[11]  Daphne Koller,et al.  Utilities as Random Variables: Density Estimation and Structure Discovery , 2000, UAI.

[12]  Daniel Rubio,et al.  Great Expectations , 2015, Logic, Rationality, and Interaction.

[13]  Uue Kjjrull.  Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .

[14]  Kristian G. Olesen,et al.  Maximal Prime Subgraph Decomposition of Bayesian Networks , 2001, FLAIRS.

[15]  David J. Spiegelhalter,et al.  Probabilistic Networks and Expert Systems , 1999, Information Science and Statistics.

[16]  P. Wakker.  Additive Representations of Preferences: A New Foundation of Decision Analysis , 1988 .

[17]  J. Neumann,et al.  Theory of Games and Economic Behavior. , 1945 .

[18]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  J. Neumann,et al.  The Theory of Games and Economic Behaviour , 1944 .

[20]  Mark Hopkins,et al.  Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees , 2001, ECSQARU.

[21]  F. B. Vernadat,et al.  Decisions with Multiple Objectives: Preferences and Value Tradeoffs , 1994 .

[22]  D. Schmeidler.  Integral representation without additivity , 1986 .

[23]  Daphne Koller,et al.  Making Rational Decisions Using Adaptive Utility Elicitation , 2000, AAAI/IAAI.

[24]  R. M. Adelson,et al.  Utility Theory for Decision Making , 1971 .

[25]  Didier Dubois,et al.  Possibility Theory as a Basis for Qualitative Decision Theory , 1995, IJCAI.

[26]  Fahiem Bacchus,et al.  Graphical models for preference and utility , 1995, UAI.

[27]  Ross D. Shachter.  Evaluating Influence Diagrams , 1986, Oper. Res..

[28]  Ronen I. Brafman,et al.  Reasoning With Conditional Ceteris Paribus Preference Statements , 1999, UAI.

[29]  Dan Geiger,et al.  A sufficiently fast algorithm for finding close to optimal clique trees , 2001, Artif. Intell..