Preference Elicitation with Uncertainty: Extending Regret Based Methods with Belief Functions

DOI10.1007/978-3-030-35514-2_22zbMath1440.68290OpenAlexW2991869302MaRDI QIDQ3297814

Pierre Guillot, Sebastien Destercke

Publication date: 20 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-35514-2_22

zbMATH Keywords

belief functionspreference elicitationmulticriteria decision

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items

Incremental elicitation of preferences: optimist or pessimist?

Cites Work

• Unnamed Item
• Unnamed Item
• Idempotent conjunctive combination of belief functions: extending the minimum rule of possibility theory
• The unnormalized Dempster's rule of combination: A new justification from the least commitment principle and some extensions
• On the Dempster-Shafer framework and new combination rules
• The application of the matrix calculus to belief functions.
• A generic framework to include belief functions in preference handling and multi-criteria decision
• Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
• Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems
• Constraint-based optimization and utility elicitation using the minimax decision criterion
• Preference Learning
• On the axiomatic justification of Dempster's rule of combination