Directional decomposition of multiattribute utility functions

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Markov models for probability distributions. In an attempt to bridge the gap, we propose a new representation for utility functions which follows its probabilistic analog to a greater extent. Starting from a simple definition of marginal utility by utilizing reference values, we define a notion of conditional utility which satisfies additive analogues of the chain rule and Bayes rule. We farther develop the analogy to probabilities by describing a directed graphical representation that relies on our concept of conditional independence. One advantage of this model is that it leads to a natural structured elicitation process, very similar to that of Bayesian networks. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brafman, R. I., & Engel, Y. (2009). Directional decomposition of multiattribute utility functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5783 LNAI, pp. 192–202). https://doi.org/10.1007/978-3-642-04428-1_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free