no code implementations • 7 Aug 2023 • Hugo Gilbert, Mohamed Ouaguenouni, Meltem Ozturk, Olivier Spanjaard
This paper is dedicated to a robust ordinal method for learning the preferences of a decision maker between subsets.
no code implementations • 15 Jun 2022 • Hugo Gilbert, Mohamed Ouaguenouni, Meltem Ozturk, Olivier Spanjaard
This paper is dedicated to a cautious learning methodology for predicting preferences between alternatives characterized by binary attributes (formally, each alternative is seen as a subset of attributes).
no code implementations • 24 Jun 2021 • Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
In this note, we prove that the Kemeny ranking problem remains NP-hard for $k$-dimensional Euclidean preferences with $k\!\ge\! 2$ under norms $\ell_1$, $\ell_2$ and $\ell_\infty$, by showing that any weighted tournament (resp.
no code implementations • 29 Jul 2020 • Nadjet Bourdache, Patrice Perny, Olivier Spanjaard
We introduce a new incremental preference elicitation procedure able to deal with noisy responses of a Decision Maker (DM).
no code implementations • 14 Nov 2019 • Hugo Gilbert, Tom Portoleau, Olivier Spanjaard
In this paper, we advocate the use of setwise contests for aggregating a set of input rankings into an output ranking.