Graphical models for preference representation: An overview

18Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Representing preferences into a compact structure has become an important research topic. Graphical models are of special interest. Indeed, they facilitate elicitation, exhibit some form of independence, and serve as a basis for solving optimization and dominance queries about choices. The expressiveness of the representation setting and the complexity of answering queries are then central issues for each approach. This paper proposes an extensive overview of the main graphical models for preference representation and provides a comparative survey by emphasizing their main characteristics. We also indicate possible transformations between some of these models. We contrast qualitative models such as CP-nets and TCP-nets with quantitative ones such as GAI networks, UCP-nets, and Marginal utility nets, and advocate π-Pref nets, recently introduced by the authors, as an interesting compromise between the two types of models.

Cite

CITATION STYLE

APA

Amor, N. B., Dubois, D., Gouider, H., & Prade, H. (2016). Graphical models for preference representation: An overview. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9858 LNAI, pp. 96–111). Springer Verlag. https://doi.org/10.1007/978-3-319-45856-4_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free