UCP-networks: a directed graphical representation of conditional utilities

Authors:
Craig Boutilier;Fahiem Bacchus;Ronen I. Brafman
Affiliations:
Department of Computer Science, University of Toronto, Toronto, ON;Department of Computer Science, University of Toronto, Toronto, ON;Department of Computer Science, Ben-Gurion University, Beer Sheva, Israel
Venue:
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Year:
2001

Citing 8
Cited 15

Making Rational Decisions Using Adaptive Utility Elicitation

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Mini-buckets: a general scheme for generating approximations in automated reasoning

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Exploiting causal independence in Bayesian network inference

Journal of Artificial Intelligence Research
Preference-based configuration of web page content

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Reasoning with conditional ceteris paribus preference statements

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Expected utility networks

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Graphical models for preference and utility

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Preferences in AI: An overview

Artificial Intelligence
Relational preference rules for control

Artificial Intelligence
Computational techniques for a simple theory of conditional preferences

Artificial Intelligence
Decision making with multiple objectives using GAI networks

Artificial Intelligence
The local geometry of multiattribute tradeoff preferences

Artificial Intelligence
Web Service Selection with Quantitative and Qualitative User Preferences

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Towards flexible information retrieval based on CP-Nets

FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Representing and reasoning with qualitative preferences for compositional systems

Journal of Artificial Intelligence Research
A stratified framework for handling conditional preferences: An extension of the analytic hierarchy process

Expert Systems with Applications: An International Journal
WCP-Nets: a weighted extension to CP-Nets for web service selection

ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Learning conditional preference network from noisy samples using hypothesis testing

Knowledge-Based Systems
Ordering based decision making - A survey

Information Fusion
Bribery in voting with CP-nets

Annals of Mathematics and Artificial Intelligence
Vector-Value Markov Decision Process for multi-objective stochastic path planning

International Journal of Hybrid Intelligent Systems
From problems to protocols: Towards a negotiation handbook

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing preference models: generalized additive models and CP-networks. The network decomposes a utility function into a number of additive factors, with the directionality of the arcs reflecting conditional dependence in the underlying (qualitative) preference ordering under a ceteris paribus interpretation. The CP-semantics ensures that computing optimization and dominance queries is very efficient. We also demonstrate the value of this representation in decision making. Finally, we describe an interactive elicitation procedure that takes advantage of the linear nature of the constraints on "tradeoff weights" imposed by a UCP-network.