Utility Functions for Ceteris Paribus Preferences
نویسندگان
چکیده
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric utility function representations to achieve computational efficiency. We provide algorithms, complete for finite universes of binary features, for converting a set of qualitative ceteris paribus preferences into quantitative utility functions.
منابع مشابه
Recompiling Utility Functions in a Changing World
Our previous work considers a method for building a numeric utility function out of qualitative ceteris paribus preferences, or preferences other things held equal. Dynamic domains embody changes in preferences. This can come in many forms. The preferences themselves may change, the variables over which preferences are expressed may change, or the forms of utility independence that hold in the ...
متن کاملAn Empirical Investigation of Ceteris Paribus Learnability
Eliciting user preferences constitutes a major step towards developing recommender systems and decision support tools. Assuming that preferences are ceteris paribus allows for their concise representation as Conditional Preference Networks (CP-nets). This work presents the first empirical investigation of an algorithm for reliably and efficiently learning CP-nets in a manner that is minimally i...
متن کاملConditional Preferences: A New Semantics for Database Queries
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preferences are limited when one needs to consider conditional, rather than absolute, preferences (e.g., I prefer driving by car in winter, and by motorbike in summer), which are common in context-aware applications. CP-nets are a...
متن کاملCeteris paribus logic in counterfactual reasoning
The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the relational structure of a model according to a ceteris paribus clause one forces out, in a natural manner, those possible worlds which do not satisfy the requ...
متن کاملReasoning With Conditional Ceteris Paribus Preference Statements
In many domains it is desirable to assess the preferences of users in a qualitative rather than quantitative way. Such representations of qualitative preference orderings form an important component of automated decision tools. We propose a graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else bei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Intelligence
دوره 20 شماره
صفحات -
تاریخ انتشار 2004