Results 1  10
of
14
CPnets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 2004
"... 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 dep ..."
Abstract

Cited by 227 (4 self)
 Add to MetaCart
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.
Reasoning with conditional ceteris paribus preference statements
 In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence
, 1999
"... 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 condi ..."
Abstract

Cited by 116 (16 self)
 Add to MetaCart
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 being equal) interpretation. Such a representation is often compact and arguably natural. We describe several search algorithms for dominance testing based on this representation; these algorithms are quite effective, especially in specific network topologies, such as chain and treestructured networks, as well as polytrees. 1
Preference Elicitation in Combinatorial Auctions (Extended Abstract)
 IN PROCEEDINGS OF THE ACM CONFERENCE ON ELECTRONIC COMMERCE (ACMEC
, 2001
"... Combinatorial auctions (CAs) where bidders can bid on bundles of items can be very desirable market mechanisms when the items sold exhibit complementarity and/or substitutability, so the bidder's valuations for bundles are not additive. However, in a basic CA, the bidders may need to bid on expone ..."
Abstract

Cited by 100 (28 self)
 Add to MetaCart
Combinatorial auctions (CAs) where bidders can bid on bundles of items can be very desirable market mechanisms when the items sold exhibit complementarity and/or substitutability, so the bidder's valuations for bundles are not additive. However, in a basic CA, the bidders may need to bid on exponentially many bundles, leading to di#culties in determining those valuations, undesirable information revelation, and unnecessary communication. In this paper we present a design of an auctioneer agent that uses topological structure inherent in the problem to reduce the amount of information that it needs from the bidders. An analysis tool is presented as well as data structures for storing and optimally assimilating the information received from the bidders. Using this information, the agent then narrows down the set of desirable (welfaremaximizing or Paretoe#cient) allocations, and decides which questions to ask next. Several algorithms are presented that ask the bidders for value, order, and rank information. A method is presented for making the elicitor incentive compatible.
Introducing Variable Importance Tradeoffs into CPNets
 In Proceedings of UAI02
"... courses of action is a cornerstone of many AI applications, and usually this requires explicit information about the decisionmaker's preferences. ..."
Abstract

Cited by 56 (11 self)
 Add to MetaCart
courses of action is a cornerstone of many AI applications, and usually this requires explicit information about the decisionmaker's preferences.
Preferencebased Constrained Optimization with CPnets
 Computational Intelligence
, 2001
"... Many AI tasks, such as product configuration, decision support, and the construction of autonomous agents, involve a process of constrained optimization, that is, optimization of behavior or choices subject to given constraints. In this paper we present an approach for constrained optimization based ..."
Abstract

Cited by 55 (10 self)
 Add to MetaCart
Many AI tasks, such as product configuration, decision support, and the construction of autonomous agents, involve a process of constrained optimization, that is, optimization of behavior or choices subject to given constraints. In this paper we present an approach for constrained optimization based on a set of hard constraints and a preference ordering represented using a CPnetwork  a graphical model for representing qualitative preference information. This approach offers both pragmatic and computational advantages. First, it provides a convenient and intuitive tool for specifying the problem, and in particular, the decision maker's preferences. Second, it provides an algorithm for finding the most preferred feasible outcomes that has the following anytime property: the set of preferred feasible outcomes are enumerated without backtracking. In particular, the first feasible solution generated by this algorithm is optimal.
A ConstraintBased Approach to Preference Elicitation and Decision Making. AAAI Spring Symposium on Qualitative Decision Theory
, 1997
"... We investigate the solution of constraintbased configuration problems in which the preference function over outcomes is unknown or incompletely specified. The aim is to configure a system, such as a personal computer, so that it will be optimal for a given user. The goal of this project is to devel ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
We investigate the solution of constraintbased configuration problems in which the preference function over outcomes is unknown or incompletely specified. The aim is to configure a system, such as a personal computer, so that it will be optimal for a given user. The goal of this project is to develop algorithms that generate the most preferred feasible configuration by posing preference queries to the user. In order to minimize the number and the complexity of preference queries posed to the user, the algorithm reasons about the user’s preferences while taking into account constraints over the set of feasible configurations. We assume that the user can structure their preferences in a particular way that, while natural in many settings, can be exploited during the optimization process. We also address in a preliminary fashion the tradeoffs between computational effort in the solution of a problem and the degree of interaction with the user. 1
On graphical modeling of preference and importance
, 2006
"... In recent years, CPnets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CPnets capture and support reasoning with qualitative conditional preference statements, statements that are relatively natural for users to express. In this paper, we extend ..."
Abstract

Cited by 50 (6 self)
 Add to MetaCart
In recent years, CPnets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CPnets capture and support reasoning with qualitative conditional preference statements, statements that are relatively natural for users to express. In this paper, we extend the CPnets formalism to handle another class of very natural qualitative statements one often uses in expressing preferences in daily life – statements of relative importance of attributes. The resulting formalism, TCPnets, maintains the spirit of CPnets, in that it remains focused on using only simple and natural preference statements, uses the ceteris paribus semantics, and utilizes a graphical representation of this information to reason about its consistency and to perform, possibly constrained, optimization using it. The extra expressiveness it provides allows us to better model tradeoffs users would like to make, more faithfully representing their preferences. 1.
Local utility elicitation in GAI models
 In Proc. of the Twentyfirst Conference on Uncertainty in Artificial Intelligence (UAI05
, 2005
"... Structured utility models are essential for the effective representation and elicitation of complex multiattribute utility functions. Generalized additive independence (GAI) models provide an attractive structural model of user preferences, offering a balanced tradeoff between simplicity and applica ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
Structured utility models are essential for the effective representation and elicitation of complex multiattribute utility functions. Generalized additive independence (GAI) models provide an attractive structural model of user preferences, offering a balanced tradeoff between simplicity and applicability. While representation and inference with such models is reasonably well understood, elicitation of the parameters of such models has been studied less from a practical perspective. We propose a procedure to elicit GAI model parameters using only “local ” utility queries rather than “global ” queries over full outcomes. Our local queries take full advantage of GAI structure and provide a sound framework for extending the elicitation procedure to settings where the uncertainty over utility parameters is represented probabilistically. We describe experiments using a myopic valueofinformation approach to elicitation in a large GAI model. 1
Regretbased Utility Elicitation in Constraintbased Decision Problems
, 2005
"... We propose new methods of preference elicitation for constraintbased optimization problems based on the use of minimax regret. Specifically, we assume a constraintbased optimization problem (e.g., product configuration) in which the objective function (e.g., consumer preferences) are unknown o ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
We propose new methods of preference elicitation for constraintbased optimization problems based on the use of minimax regret. Specifically, we assume a constraintbased optimization problem (e.g., product configuration) in which the objective function (e.g., consumer preferences) are unknown or imprecisely specified. Assuming a graphical utility model, we describe several elicitation strategies that require the user to answer only binary (bound) queries on the utility model parameters. While a theoretically motivated algorithm can provably reduce regret quickly (in terms of number of queries), we demonstrate that, in practice, heuristic strategies perform much better, and are able to find optimal (or nearoptimal) configurations with far fewer queries.
Constraintbased Optimization with the Minimax Decision Criterion
 In Ninth International Conference on Principles and Practice of Constraint Programming
, 2003
"... In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of computing a best feasible solution when the user's utilities are partially known. Assuming bounds on utilities, efficient mixed ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of computing a best feasible solution when the user's utilities are partially known. Assuming bounds on utilities, efficient mixed integer linear programs are devised to compute the solution with minimax regret while exploiting generalized additive structure in a user's utility function.