Repositorio de producción científica de la Universidad de Sevilla

Inferring efficient weights from pairwise comparison matrices

 

Advanced Search
 
Opened Access Inferring efficient weights from pairwise comparison matrices
Cites

Show item statistics
Icon
Export to
Author: Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Conde Sánchez, Eduardo
Department: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Date: 2006-10
Published in: Mathematical Methods of Operations Research, 64 (2), 271-284.
Document type: Article
Abstract: Several multi-criteria-decision-making methodologies assume the existence of weights associated with the different criteria, reflecting their relative importance.One of the most popular ways to infer such weights is the analytic hierarchy process, which constructs first a matrix of pairwise comparisons, from which weights are derived following one out of many existing procedures, such as the eigenvector method or the least (logarithmic) squares. Since different procedures yield different results (weights) we pose the problem of describing the set of weights obtained by “sensible” methods: those which are efficient for the (vector-) optimization problem of simultaneous minimization of discrepancies. A characterization of the set of efficient solutions is given, which enables us to assert that the least-logarithmic-squares solution is always efficient, whereas the (widely used) eigenvector solution is not, in some cases, efficient, thus its use in practice may be questionable.
Cite: Blanquero Bravo, R., Carrizosa Priego, E.J. y Conde Sánchez, E. (2006). Inferring efficient weights from pairwise comparison matrices. Mathematical Methods of Operations Research, 64 (2), 271-284.
Size: 224.2Kb
Format: PDF

URI: http://hdl.handle.net/11441/47872

DOI: 10.1007/s00186-006-0077-1

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)