NP-Completeness of Outcome Optimization for Partial CP-Nets

نویسندگان

  • Keith Purrington
  • Edmund H. Durfee
چکیده

CP-nets (Boutilier 2004) represent qualitative conditional preferences using a graphical model similar in concept to a belief network. A CP-net describes the preferences over the values of each problem variable, possibly conditioned on the values of other variables. For example, a user might describe her ideal dinner by expressing an (unconditional) preference for a meat entrée over a fish entrée, and a preference for wine that depends on the particular choice of entrée (red wine with meat, and white wine with fish). The CP-net for this diner would look like the one in Figure 1, with the exception that a preference would be expressed for the value of D. CP-nets make it easy to find the most preferred meal using a linear forward sweep algorithm. First, a meat entrée is selected based on the unconditional preference. Then, wine is selected to match the choice of entrée: red in this example.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

modeling and reasoning about preferences with cp - nets

Structured modeling of ceteris paribus qualitative preference statements, grounded in the notions of preferential independence, has tremendous potential to provide effective and efficient tools for modeling and reasoning about decision maker preferences in real-life applications. Within the AI and phylosophical logic communities, past work on qualitative preference representation has tended to ...

متن کامل

Optimal Decision Making with CP-nets and PCP-nets

Probabilistic conditional preference networks (PCP-nets) are a generalization of CP-nets for compactly representing preferences over multi-attribute domains. We introduce the notion of a loss function whose inputs are a CP-net and an outcome. We focus on the optimal decision-making problem for acyclic and cyclic CP-nets and PCP-nets. Our motivations are three-fold: (1) our framework naturally e...

متن کامل

Often Harder than in the Constructive Case: Destructive Bribery in CP-nets

We study the complexity of the destructive bribery problem—an external agent tries to prevent a disliked candidate from winning by bribery actions— in voting over combinatorial domains, where the set of candidates is the Cartesian product of several issues. This problem is related to the concept of the margin of victory of an election which constitutes a measure of robustness of the election ou...

متن کامل

Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete

The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is polynomial. We show that this is unlikely: the problem is NP-complete.

متن کامل

Reachability in Live and Safe Free - Choice

The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is polynomial. We show that this is unlikely: the problem is NP-complete.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008