Add to ORKGWe describe the semantic foundations for elicitation of gen-eralized additively independent (GAI) utilities using the min-imax regret criterion, and propose several new query types and strategies for this purpose. Computational feasibility is obtained by exploiting the local GAI structure in the model. Our results provide a practical approach for implementing preference-based constrained configuration optimization as well as effective search in multiattribute product databases
Autonomic (self-managing) computing systems face the critical problem of resource allocation to diff...
This paper deals with preference representation and elicitation in the context of multiattribute uti...
We consider the elicitation of incomplete preference information for the additive utility model in t...
AbstractIn many situations, a set of hard constraints encodes the feasible configurations of some sy...
In many situations, a set of hard constraints encodes the feasible configurations of some system or ...
We propose new methods of preference elicitation for constraint-based optimization problems based on...
In this thesis, we present a decision-theoretic framework for building decision support systems that...
In this thesis, we present a decision-theoretic framework for building decision support systems that...
Structured utility models are essential for the effective representation and elicitation of complex ...
Classic direct mechanisms suffer from the drawback of requiring full type (or utility function) reve...
International audienceThis paper deals with preference elicitation and preference-based optimization...
Markov decision processes (MDPs) have proven to be a useful model for sequential decision- theoretic...
Markov decision processes (MDPs) have proven to be a useful model for sequential decision- theoretic...
International audienceThis paper deals with preference representation and elicitation in the context...
Background. A generalization of the minimax regret criterion is represented as even the best-assuran...
Autonomic (self-managing) computing systems face the critical problem of resource allocation to diff...
This paper deals with preference representation and elicitation in the context of multiattribute uti...
We consider the elicitation of incomplete preference information for the additive utility model in t...
AbstractIn many situations, a set of hard constraints encodes the feasible configurations of some sy...
In many situations, a set of hard constraints encodes the feasible configurations of some system or ...
We propose new methods of preference elicitation for constraint-based optimization problems based on...
In this thesis, we present a decision-theoretic framework for building decision support systems that...
In this thesis, we present a decision-theoretic framework for building decision support systems that...
Structured utility models are essential for the effective representation and elicitation of complex ...
Classic direct mechanisms suffer from the drawback of requiring full type (or utility function) reve...
International audienceThis paper deals with preference elicitation and preference-based optimization...
Markov decision processes (MDPs) have proven to be a useful model for sequential decision- theoretic...
Markov decision processes (MDPs) have proven to be a useful model for sequential decision- theoretic...
International audienceThis paper deals with preference representation and elicitation in the context...
Background. A generalization of the minimax regret criterion is represented as even the best-assuran...
Autonomic (self-managing) computing systems face the critical problem of resource allocation to diff...
This paper deals with preference representation and elicitation in the context of multiattribute uti...
We consider the elicitation of incomplete preference information for the additive utility model in t...