A new web service for the stable sorting of a set of alternatives
Résumé
We present a new web service which computes the stable sorting of some alternatives into predefined categories, bounded with some given profiles, according to the principles of the outranking methods. It takes into account the notion of stability, which informs on the dependency of the outrankings to the preorder of the weights, and defines for each alternative an interval of categories on which it is affected in a stable manner: knowing the preorder of the weights only, not a precise setting, we ensure that the alternative will be sorted in one of the categories of the interval.