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
โฆ LIBER โฆ
Formation of a vector criterion on the basis of a binary preference relation
โ Scribed by Z.V. Morozov; V.V. Fedorov
- Publisher
- Elsevier Science
- Year
- 1980
- Weight
- 646 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Ranking Alternatives on the Basis of Pre
โ
DENIS BOUYSSOU; PHILIPPE VINCKE
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 173 KB
Continuous representation of a preferenc
โ
Alain Chateauneuf
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 499 KB
A criterion for determining exceedance o
โ
John W. Reed; Robert P. Kassawara
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 776 KB
New Results on the Common Consequent Ind
โ
Zhou Bo; Bolian Liu
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 130 KB
We characterize the binary relations with the largest and next largest common consequent indices, and disclose the existence of gaps in the set of common consequent indices of binary relations. We also obtain the largest common consequent indices of binary relations in the classes of reducible and s
The economical construction of a transit
โ
V.V. Martynyuk
๐
Article
๐
1963
๐
Elsevier Science
โ 276 KB
On a Reconstruction of Models with Only
โ
Pawel Pazdyka
๐
Article
๐
1988
๐
John Wiley and Sons
๐
English
โ 715 KB