Consistency-driven approximation of a pairwise comparison matrix
Kybernetika, Tome 39 (2003) no. 5, p. [561]
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within a distance-based framework. In this context, Goal Programming is introduced as a flexible tool for computing priority weights.
Classification :
90B50, 90C29, 91B08
Keywords: ranking theory; pairwise comparison; distance-based methods; goal programming
Keywords: ranking theory; pairwise comparison; distance-based methods; goal programming
@article{KYB_2003__39_5_a4,
author = {Dopazo, Esther and Gonz\'alez-Pach\'on, Jacinto},
title = {Consistency-driven approximation of a pairwise comparison matrix},
journal = {Kybernetika},
pages = {[561]},
publisher = {mathdoc},
volume = {39},
number = {5},
year = {2003},
mrnumber = {2042341},
zbl = {1249.91025},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_2003__39_5_a4/}
}
Dopazo, Esther; González-Pachón, Jacinto. Consistency-driven approximation of a pairwise comparison matrix. Kybernetika, Tome 39 (2003) no. 5, p. [561]. http://geodesic.mathdoc.fr/item/KYB_2003__39_5_a4/