Consistency-driven approximation of a pairwise comparison matrix

Esther Dopazo; Jacinto González-Pachón

Kybernetika (2003)

  • Volume: 39, Issue: 5, page [561]-568
  • ISSN: 0023-5954

Abstract

top
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.

How to cite

top

Dopazo, Esther, and González-Pachón, Jacinto. "Consistency-driven approximation of a pairwise comparison matrix." Kybernetika 39.5 (2003): [561]-568. <http://eudml.org/doc/33665>.

@article{Dopazo2003,
abstract = {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.},
author = {Dopazo, Esther, González-Pachón, Jacinto},
journal = {Kybernetika},
keywords = {ranking theory; pairwise comparison; distance-based methods; goal programming; ranking theory; pairwise comparison; distance-based methods; goal programming},
language = {eng},
number = {5},
pages = {[561]-568},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Consistency-driven approximation of a pairwise comparison matrix},
url = {http://eudml.org/doc/33665},
volume = {39},
year = {2003},
}

TY - JOUR
AU - Dopazo, Esther
AU - González-Pachón, Jacinto
TI - Consistency-driven approximation of a pairwise comparison matrix
JO - Kybernetika
PY - 2003
PB - Institute of Information Theory and Automation AS CR
VL - 39
IS - 5
SP - [561]
EP - 568
AB - 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.
LA - eng
KW - ranking theory; pairwise comparison; distance-based methods; goal programming; ranking theory; pairwise comparison; distance-based methods; goal programming
UR - http://eudml.org/doc/33665
ER -

References

top
  1. Brin S., Page L., 10.1016/S0169-7552(98)00110-X, Computer Networks and ISDN Systems 30 (1998), 107–117 (1998) DOI10.1016/S0169-7552(98)00110-X
  2. Charnes A., Cooper W. W., 10.1016/S0377-2217(77)81007-2, European J. Oper. Res. 1 (1977), 39–54 (1977) MR0452646DOI10.1016/S0377-2217(77)81007-2
  3. Chu M. T., On the optimal consistent approximation to pairwise comparison matrices, Linear Algebra Appl. 272 (1998), 155–168 (1998) Zbl0905.62005MR1489384
  4. González-Pachón J., Romero C., 10.1016/S0305-0483(98)00052-8, Omega 27 (1999), 341–347 (1999) DOI10.1016/S0305-0483(98)00052-8
  5. Ignizio J. P., Cavalier T. M., Linear Programming, Prentice-Hall, Englewood Cliffs, N.J. 1994 
  6. Jensen R. E., 10.1016/0022-2496(84)90003-8, J. Math. Psychology 28 (1984), 317–332 (1984) DOI10.1016/0022-2496(84)90003-8
  7. Kendall M. G., 10.2307/3001479, Biometrics 11 (1955), 43–62 (1955) MR0075506DOI10.2307/3001479
  8. Koczkodaj W., Orlowski M., 10.1016/S0898-1221(99)00048-6, Comput. Math. Appl. 37 (1999), 79–85 (1999) Zbl0936.65057MR1674423DOI10.1016/S0898-1221(99)00048-6
  9. Romero C., Handbook of Critical Issues in Goal Programming, Pergamon Press, London 1991 Zbl0817.68034
  10. Saaty T. L., The Analytic Hierarchy Process, McGraw-Hill, New York 1980 Zbl1184.90094MR0773297
  11. Saaty T. L., Vargas L. G., 10.1016/0270-0255(84)90008-3, Math. Model. 5 (1984), 309–324 (1984) MR0781652DOI10.1016/0270-0255(84)90008-3
  12. Wei T. H., The Algebraic Foundations of Ranking Theory, Cambridge Univ. Press, Cambridge 1952 

NotesEmbed ?

top

You must be logged in to post comments.