CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements

Abstract

Information about user preferences plays a key role in automated decision making. In many domains it is desirable to assess such preferences in a qualitative rather than quantitative way. In this paper, we propose a qualitative graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else being equal) interpretation. Such a representation is often compact and arguably quite natural in many circumstances. We provide a formal semantics for this model, and describe how the structure of the network can be exploited in several inference tasks, such as determining whether one outcome dominates (is preferred to) another, ordering a set outcomes according to the preference relation, and constructing the best outcome subject to available evidence.

References in corpus (9)

• Graphical Models for Preference and Utility
• UCP-Networks: A Directed Graphical Representation of Conditional Utilities
• Introducing Variable Importance Tradeoffs into CP-Nets
• Structure and Complexity in Planning with Unary Operators
• Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
• Utility Elicitation as a Classification Problem
• Expected Utility Networks
• The Decision-Theoretic Interactive Video Advisor
• Conditional Utility, Utility Independence, and Utility Networks

Cited by in corpus (48)

• Autonomous Agents Modelling Other Agents: A Comprehensive Survey and Open Problems
• Determining Possible and Necessary Winners Given Partial Orders
• The Computational Complexity of Dominance and Consistency in CP-Nets
• Preference-based Search using Example-Critiquing with Suggestions
• Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
• On the Qualitative Comparison of Decisions Having Positive and Negative Features
• Probabilistic Conditional Preference Networks
• Elections with Few Voters: Candidate Control Can Be Easy
• Beyond Preferences in AI Alignment
• Graph Aggregation
• On Solving Boolean Multilevel Optimization Problems
• CP-nets and Nash equilibria
• Allocating Indivisible Items in Categorized Domains
• Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting
• An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
• I Don't Want to Think About it Now:Decision Theory With Costly Computation
• Mechanism Design for Multi-Type Housing Markets
• More-or-Less CP-Networks
• When Is It Acceptable to Break the Rules? Knowledge Representation of Moral Judgement Based on Empirical Data
• Combinatorial Voter Control in Elections
• Computation and Complexity of Preference Inference Based on Hierarchical Models
• Multi-Context Systems: Dynamics and Evolution (Pre-Print of "Multi-context systems in dynamic environments")
• From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group)
• CPMetric: Deep Siamese Networks for Learning Distances Between Structured Preferences
• Solution Dominance over Constraint Satisfaction Problems
• On the Hardness of Bribery Variants in Voting with CP-Nets
• Monotonic and Nonmonotonic Preference Revision
• An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information
• Multi-type Resource Allocation with Partial Preferences
• Often harder than in the Constructive Case: Destructive Bribery in CP-nets
• Lecture Notes on Fair Division
• Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models
• Probabilistic Serial Mechanism for Multi-Type Resource Allocation
• OPRA: An Open-Source Online Preference Reporting and Aggregation System
• Logical Conditional Preference Theories
• Solving planning domains with polytree causal graphs is NP-complete
• A comparison of the notions of optimality in soft constraints and graphical games
• Preference Reasoning in Matching Procedures: Application to the Admission Post-Baccalaureat Platform
• Encoding monotonic multi-set preferences using CI-nets: preliminary report
• Enriching a CP-Net by Asymmetric Merging
• Contracting preference relations for database applications
• Learning and Optimization with Submodular Functions
• A Primer on Strategic Games
• A CP-Net based Qualitative Composition Approach for an IaaS Provider
• Database Querying under Changing Preferences
• Sequential Mechanisms for Multi-type Resource Allocation
• Human-Machine Collaborative Optimization via Apprenticeship Scheduling
• Comparing the notions of optimality in CP-nets, strategic games and soft constraints