Utility Functions for Ceteris Paribus Preferences

Computational Intelligence (Impact Factor: 0.87). 04/2004; 20(2):158 - 217. DOI: 10.1111/j.0824-7935.2004.00235.x
Source: DBLP

ABSTRACT Ceteris paribus (all-else equal) preference statements concisely represent preferences over outcomes or goals in a way natural to human thinking. Although deduction in a logic of such statements can compare the desirability of specific conditions or goals, many decision-making methods require numerical measures of degrees of desirability. To permit ceteris paribus specifications of preferences while providing quantitative comparisons, we present an algorithm that compiles a set of qualitative ceteris paribus preferences into an ordinal utility function. Our algorithm is complete for a finite universe of binary features. Constructing the utility function can, in the worst case, take time exponential in the number of features, but common independence conditions reduce the computational burden. We present heuristics using utility independence and constraint-based search to obtain efficient utility functions.

Download full-text


Available from: Jon Doyle, Jun 19, 2015
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Whereas today's information systems are well-equipped for efficient query handling, their strict mathematical foundations hamper their use for everyday tasks. In daily life, people expect information to be offered in a personalized and focused way. But currently, personalization in digital systems still only takes explicit knowledge into account and does not yet process conceptual information often naturally implied by users. We discuss how to bridge the gap between users and today's systems, building on results from cognitive psychology.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Decision making is required by many tasks, such as shopping, nowadays assisted by software systems, and providing support to the decision making process is a feature that would significantly improve such systems. Many decision support systems and related approaches have been proposed to that purpose, but they often involve tedious elicitation processes or previously collected data. In this paper, we propose an automated decision making technique, which chooses an option from the set of those available based on preferences and priorities expressed in a high-level preference language, exploiting natural-language terms, such as expressive speech acts. Moreover, in order to make a decision, our technique goes beyond the provided preferences with psychology-inspired heuristics, which concern how humans make decisions, as provided preferences are typically not enough to resolve trade-offs among available options. Two studies were performed to evaluate our approach, and results indicate that our technique is effective both by comparing its recommendations with those made by a human expert, and by considering evaluation scores provided by users that experienced our technique.
    Engineering Applications of Artificial Intelligence 06/2015; 42. DOI:10.1016/j.engappai.2015.03.008 · 1.96 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A basic task in preference reasoning is inferring a pref-erence between a pair of outcomes (alternatives) from an input set of preference statements. This preference inference task for compara-tive preferences has been shown to be computationally very hard for the standard kind of inference. Recently, a new kind of preference inference has been developed, which is polynomial for relatively ex-pressive preference languages, and has the additional property of be-ing much less conservative; this can be a major advantage, since it will tend to make the number of undominated outcomes smaller. It derives from a semantics where models are weak orders that are gen-erated by objects called cp-trees, which represent a kind of condi-tional lexicographic order. We show that there are simple conditions, based on the notion of importance, that determine whether a weak order can be generated by a cp-tree of the given form. This enables a simple characterisation of the less conservative preference inference. We go on to study the importance properties satisfied by a simple kind of cp-tree, leading to another characterisation of the correspond-ing preference inference.