AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Use of convex cones in interactive multiple objective decision making
Management Science
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
UCP-Networks: A Directed Graphical Representation of Conditional Utilities
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
A POMDP formulation of preference elicitation problems
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)
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Compact value-function representations for qualitative preferences
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Journal of Artificial Intelligence Research
On graphical modeling of preference and importance
Journal of Artificial Intelligence Research
Reasoning with conditional ceteris paribus preference statements
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
A hybrid approach to reasoning with partially elicited preference models
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
Generic preferences over subsets of structured objects
Journal of Artificial Intelligence Research
Efficient inference for expressive comparative preference languages
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Learning conditional preference networks
Artificial Intelligence
Evaluating, combining and generalizing recommendations with prerequisites
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Preferences in AI: An overview
Artificial Intelligence
Computational techniques for a simple theory of conditional preferences
Artificial Intelligence
The local geometry of multiattribute tradeoff preferences
Artificial Intelligence
| Hi-index | 0.00 |
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly simple and compact form, making their elicitation much easier. In this paper we consider preferences over discrete domains, and show that for a certain class of simple and intuitive qualitative preference statements, one can always generate compact value functions consistent with these statements. These value functions maintain the independence structure implicit in the original statements. For discrete domains, these representation theorems are much more general than previous results. However, we also show that it is not always possible to maintain this compact structure if we add explicit ordering constraints among the available outcomes.