Premium
Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations
Author(s) -
BOUYSSOU DENIS,
VINCKE PHILIPPE
Publication year - 1997
Publication title -
journal of multi‐criteria decision analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.462
H-Index - 47
eISSN - 1099-1360
pISSN - 1057-9214
DOI - 10.1002/(sici)1099-1360(199703)6:2<77::aid-mcda144>3.0.co;2-i
Subject(s) - transitive relation , ranking (information retrieval) , binary relation , preference relation , rank (graph theory) , basis (linear algebra) , set (abstract data type) , relation (database) , multiple criteria decision analysis , mathematics , order (exchange) , preference , emphasis (telecommunications) , mathematical economics , computer science , mathematical optimization , operations research , combinatorics , artificial intelligence , statistics , data mining , discrete mathematics , economics , telecommunications , geometry , finance , programming language
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 this problem and show how they may be useful in order to guide the choice of a particular technique. © 1997 John Wiley & Sons, Ltd.