Sciweavers

Share
UAI
2004
10 years 28 days ago
Compact Value-Function Representations for Qualitative Preferences
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation foc...
Ronen I. Brafman, Carmel Domshlak, Tanya Kogan
IJCAI
2003
10 years 29 days ago
A New Look at the Semantics and Optimization Methods of CP-Networks
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. CP-nets were designed to make the preference elicitation proces...
Ronen I. Brafman, Yannis Dimopoulos
IJCAI
2003
10 years 29 days ago
On the Foundations of Expected Expected Utility
Intelligent agents often need to assess user utility functions in order to make decisions on their behalf, or predict their behavior. When uncertainty exists over the precise natu...
Craig Boutilier
AAAI
2006
10 years 1 months ago
Preference Elicitation and Generalized Additive Utility
Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences ...
Darius Braziunas, Craig Boutilier
AAAI
2006
10 years 1 months ago
Preferences over Sets
Research on preference elicitation and reasoning typically focuses on preferences over single objects of interest. However, in a number of applications the "outcomes" of...
Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Sh...
IJCAI
2007
10 years 1 months ago
Incompleteness and Incomparability in Preference Aggregation
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
AIA
2007
10 years 1 months ago
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...
Sérgio R. de M. Queiroz
ATAL
2008
Springer
10 years 1 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ATAL
2008
Springer
10 years 1 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
ICCBR
2003
Springer
10 years 4 months ago
Case-Based Ranking for Decision Support Systems
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
Paolo Avesani, Sara Ferrari, Angelo Susi
books