# Efficient vectors in priority setting methodology

arXiv: https://arxiv.org/abs/2305.04886 · HTML: https://mlsanity.com/paper/2305.04886/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 May 2023.

## Built on by (most cited first, 1 of 1)

- [Anchored Regularized Direct Least Squares (ARDLS): Integrating Established Prioritization Operators for Priority Elicitation in the Analytic Hierarchy Process](https://mlsanity.com/paper/2608.21187/) (2026)

## Abstract (arXiv)

The Analytic Hierarchy Process (AHP) is a much discussed method in ranking business alternatives based on empirical and judgemental information. We focus here upon the key component of deducing efficient vectors for a reciprocal matrix of pair-wise comparisons. It is not yet known how to produce all efficient vectors. It has been shown that the entry-wise geometric mean of all columns is efficient for any reciprocal matrix. Here, by combining some new basic observations with some known theory, we 1) give a method for inductively generating large collections of efficient vectors, and 2) show that the entry-wise geometric mean of any collection of distinct columns of a reciprocal matrix is efficient. We study numerically, using different measures, the performance of these geometric means in approximating the reciprocal matrix by a consistent matrix.