Jérôme Mengin — accepted AI-conference papers

2026

Explaining Tournament Solutions with Minimal Supports

Clément Contet, Umberto Grandi, Jérôme Mengin

AAAI 2026technical

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 candidate appears among the winners under various tournament rules. To this end, we identify minimal supports—minimal sub-

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Learning Conditional Preference Networks: An Approach Based on the Minimum Description Length Principle

Pierre-François Gimenez, Jérôme Mengin

IJCAI 2024poster

CP-nets are a very expressive graphical model for the representation of preferences over combinatorial spaces. They are particularly well suited for settings where an important task is to compute the optimal completion of some partially specified alternative; this is for instance the case of interac…

Cited by 0 Source ↗PDF ↗code ↗Scholar ↗