Ranking Alternatives on the Basis of Pre
β
DENIS BOUYSSOU; PHILIPPE VINCKE
π
Article
π
1997
π
John Wiley and Sons
π
English
β 173 KB
This paper is devoted to the study of techniques allowing one to rank order the elements of a finite set on the basis of a non-necessarily complete or transitive binary relation. In the area of MCDM, such a problem occurs with outranking methods. We review a number of theoretical results concerning