Compact value-function representations for qualitative preferences

Authors:
Ronen I. Brafman;Carmel Domshlak;Tanya Kogan
Affiliations:
Ben-Gurion University, Beer Sheva, Israel;Cornell University, Ithaca, NY;Ben-Gurion University, Beer Sheva, Israel
Venue:
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Year:
2004

Citing 13
Cited 11

SmartClients: Constraint Satisfaction as a Paradigm for Scaleable Intelligent Information Systems

Constraints
UCP-Networks: A Directed Graphical Representation of Conditional Utilities

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
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
A POMDP formulation of preference elicitation problems

Eighteenth national conference on Artificial intelligence
Efficient utility functions for ceteris paribus preferences

Eighteenth national conference on Artificial intelligence
Visual exploration and incremental utility elicitation

Eighteenth national conference on Artificial intelligence
Preference formulas in relational queries

ACM Transactions on Database Systems (TODS)
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Reasoning with conditional ceteris paribus preference statements

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Introducing variable importance tradeoffs into CP-nets

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

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Problem-focused incremental elicitation of multi-attribute tility models

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence

Generalized value decomposition and structured multiattribute auctions

Proceedings of the 8th ACM conference on Electronic commerce
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks

AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Graphically structured value-function compilation

Artificial Intelligence
On graphical modeling of preference and importance

Journal of Artificial Intelligence Research
Compact Preference Representation in Stable Marriage Problems

ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Compactly representing utility functions using weighted goals and the max aggregator

Artificial Intelligence
An Efficient Procedure for Collective Decision-making with CP-nets

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Relational preference rules for control

Artificial Intelligence
Decision making with multiple objectives using GAI networks

Artificial Intelligence
The local geometry of multiattribute tradeoff preferences

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

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored representation of users' preferences. Such models require less information to construct and support efficient reasoning algorithms. This paper makes two substantial contributions to this area: (1) Strong representation theorems for factored value functions. (2) A methodology that utilizes our representation results to address the problem of optimal item selection.