37 citations · 55 across the 7 of their papers we have counts for
7 papers
Characterizing Necessary Losers to Explain Tournaments Solutions
Contet Clément, Umberto Grandi, Jérôme Mengin
We study the problem of formally explaining why a candidate was not selected by a given tournament rule, by identifying sub-tournaments in which the candidate loses independently o…
Explaining Tournament Solutions with Minimal Supports
Clément Contet, Umberto Grandi, Jérôme Mengin
Tournaments are widely used models to represent pairwise dominance between candidates, alternatives, or teams. We study the problem of providing certified explanations for why a ca…
Abductive and Contrastive Explanations for Scoring Rules in Voting
Clément Contet, Umberto Grandi, Jérôme Mengin
We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, mos…
The complexity of unsupervised learning of lexicographic preferences
Hélène Fargier, Pierre-François Gimenez, Jérôme Mengin +1
This paper considers the task of learning users' preferences on a combinatorial set of alternatives, as generally used by online configurators, for example. In many settings, only…
An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
Hélène Fargier, Stefan Mengel, Jérôme Mengin
Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexic…
Probabilistic Conditional Preference Networks
Damien Bigot, Bruno Zanuttini, Helene Fargier +1
In order to represent the preferences of a group of individuals, we introduce Probabilistic CP-nets (PCP-nets). PCP-nets provide a compact language for representing probability dis…