Preference Elicitation with Uncertainty: Extending Regret Based Methods with Belief Functions
Preference elicitation is a key element of any multi-criteria decision analysis (MCDA) problem, and more generally of individual user preference learning. Existing efficient elicitation procedures in the literature mostly use either robust or Bayesian approaches. In this paper, we are interested in extending the former ones by allowing the user to express uncertainty in addition of her preferential information and by modelling it through belief functions. We show that doing this, we preserve the strong guarantees of robust approaches, while overcoming some of their drawbacks. In particular, our approach allows the user to contradict herself, therefore allowing us to detect inconsistencies or ill-chosen model, something that is impossible with more classical robust methods.
KeywordsBelief functions Preference elicitation Multicriteria decision
- 9.Klawonn, F., Smets, P.: The dynamic of belief in the transferable belief model and specialization-generalization matrices. In: Proceedings of the 8th Conference on Uncertainty in Artificial Intelligence (2013)Google Scholar