Efficiency analysis of double perturbed pairwise comparison matrices

TL;DR

This paper investigates the efficiency of the eigenvector method in deriving weight vectors from double perturbed pairwise comparison matrices, showing it produces efficient solutions in this context.

Contribution

It provides a novel analysis demonstrating that the eigenvector method yields efficient weight vectors for double perturbed pairwise comparison matrices.

Findings

Eigenvector method produces efficient weights for double perturbed matrices.

Double perturbed matrices can be made consistent by altering two elements and their reciprocals.

The analysis enhances understanding of the eigenvector method's effectiveness in specific matrix cases.

Abstract

Efficiency is a core concept of multi-objective optimization problems and multi-attribute decision making. In the case of pairwise comparison matrices a weight vector is called efficient if the approximations of the elements of the pairwise comparison matrix made by the ratios of the weights cannot be improved in any position without making it worse in some other position. A pairwise comparison matrix is called double perturbed if it can be made consistent by altering two elements and their reciprocals. The most frequently used weighting method, the eigenvector method is analyzed in the paper, and it is shown that it produces an efficient weight vector for double perturbed pairwise comparison matrices.