On Strict Ranking by Pairwise Comparisons

Jean-Pierre Magnot

doi:10.2478/amsil-2026-0005

1. Introduction

The ranking problem in the pairwise comparisons method (PC method) is a central challenge when prioritizing or selecting alternatives based on multiple criteria. PC method involves comparing alternatives using pairwise comparisons, but when inconsistencies arise in these comparisons, the process of deriving a definitive ranking becomes challenging. This issue can be caused by human judgment biases, conflicting comparisons, or the inherent complexity of the problem. Resolving this ranking issue is critical to ensuring that the PC method produces meaningful and accurate decision outcomes.

This problem has been widely studied in theoretical literature (e.g., [1, 2, 3, 4, 5, 8, 11, 12, 13, 14, 15, 16, 19, 20, 21, 22, 24]) and applied to various fields, including asset management and finance [10, 25], wireless networks [17], and more. However, the issue of obtaining a strict ranking without equally ranked alternatives remains an open problem. In this paper, we propose a mathematical approach to address this issue, leveraging the topology of positive real numbers and the concept of finite configurations.

Our contributions include the introduction of the ℛ-condition, which ensures that a strict ranking is achievable without consistency in the PC matrix (regardless its concrete meaning). They also provide a study on the robustness of this ranking method under a chosen way to produce a consistent PC matrix from a inconsistent one. They finally suggest a minimization problem that can be applied to any pairwise comparisons matrix. We prove that this last problem procuces only consistent pairwise comparisons matrices that produce a strict ranking.

The paper is structured as follows:

In Section 2, we introduce preliminary results on pairwise comparison matrices, inconsistency indices, and procedures making consistent a PC matrix.
In Section 3, we explore the structures in pairwise comparisons that lead to a strict ranking and discuss the limitations of consistencization procedures making consistent a PC matrix.
In Section 4, we propose a minimization problem to achieve non-equal ranking and outline potential methods for solving it.
In conclusion, we address the meaning of the mathematical structures described in this work, and we give in the appendix a short description of a mathematical object, called finite configurations, which reminiscently appeared as a shadow behind the investigations that led to the production of this paper.

2. Preliminaries

Let n be an integer, n ≥ 3. A n-pairwise comparison (PC) matrix (a_i,j) is a n × n matrix with entries in $ℝ_{+}^{*} = {x \in ℝ | x > 0}$ , such that for all i, j, we have $a_{j, i} = a_{i, j}^{- 1}$ . The set of n × n PC matrices is denoted by PC_n. For the rigor and the fluidity of the notations, we will use extensively the Bourbaki’s notation ℕ_n = {1, ⋯ , n} for n ∈ ℕ^∗.

Inconsistencies in pairwise comparisons can be explained using cycles of three comparisons, called triads, such as (x, y, z), where the transitivity property is violated, i.e., x · z ≠ y, which leads to inconsistency. To measure inconsistency, we typically define inconsistency indicators, which are mappings from PC_n to ℝ₊.

Remark 2.1

Inconsistency, in this context, refers to a measure of inconsistency, not the concept itself. A consistent matrix satisfies the relation a_i,j · a_j,k = a_i,k.

A consistent n-PC matrix (denoted by CPC_n) allows us to assign weights (w_i)_{i∈ℕ_n} to the items, such that $a_{i, j} = \frac{w_{i}}{w_{j}}$ . These weights provide a numerical ranking of the alternatives.

One efficient method for minimizing a functional is the gradient method, which has been successfully applied to inconsistency indicators in [22]. The gradient method identifies the direction in which the inconsistency decreases most rapidly. By applying the gradient method, we can make the necessary adjustments to the initial PC matrix to minimize inconsistency and achieve a strict ranking. However, as already observed in [22], confirming the first observations of e.g. [3] on less refined settings, two procedures making consistent a PC matrix. can lead to different rankings.

2.1. From multiplication to addition: A key approach for making a PC matrix consistent

The logarithmic map ln is a morphism of groups from the multiplicative group $(ℝ_{+}^{*}, \cdot)$ to the additive group (ℝ, +). This correspondence allows us to transform PC matrices expressed in multiplication into those expressed in addition. For example, the multiplicative PC matrix

(\begin{matrix} 1 & e^{a} & e^{b} \\ e^{- a} & 1 & e^{c} \\ e^{- b} & e^{- c} & 1 \end{matrix})

can be transformed into the corresponding additive PC matrix

(\begin{matrix} 0 & a & b \\ - a & 0 & c \\ - b & - c & 0 \end{matrix}) .

The transformation to addition simplifies the process of making a matrix consistent in some already existing procedures making consistent a PC matrix, in particular in the method described in [13], in which the orthogonal projection method applied to additive PC matrices helps achieve consistency.

2.2. Lie theory and loop quantum gravity: Insights into pairwise comparison matrices

From a Lie theory perspective, $ℝ_{+}^{*}$ is an Abelian Lie group, and its tangent space at 1 corresponds to its Lie algebra, which can be identified with ℝ. The exponential map exp: $ℝ \to ℝ_{+}^{*}$ is a smooth diffeomorphism. In the context of quantum gravity and Yang-Mills theory, the minimization of the distance between holonomies and 1 is of interest. We apply these concepts to pairwise comparisons by considering the logarithmic transformation. This approach is described in [6, 19, 20].

In the following sections, we continue by detailing the minimization problem that leads to a strict ranking without equal items. This problem is formulated to allow the use of gradient methods for efficient solution computation.

3. Strict ranking, related sets of weights, and pairwise comparisons

A strict ranking is defined by a family of weights (w_i)_{i∈ℕ_n}, where these weights define an injective map ℕ_n → ℝ+^∗. This is equivalent to the condition ${(w_{i})}_{i \in ℕ_{n}} \in O Γ_{n} (ℝ_{+}^{*})$ , as detailed in the appendix. Moreover, let 𝔖_n denote the group of bijections of the set ℕ_n. The condition of strict ranking is then equivalent to the existence of a permutation σ ∈ 𝔖_n such that the weights satisfy:

w_{σ (1)} < \dots < w_{σ (n)}

and the corresponding consistent pairwise comparison (PC) matrix with coefficients a_i,j = w_i/w_j must satisfy the ranking condition:

(1)

i = j \Leftrightarrow a_{i, j} = 1 .

This condition is referred to as the ranking condition or the ℛ-condition.

Definition 3.1.

For n ≥ 3, let ℛPC_n denote the set of n × n pairwise comparison matrices (which are not necessarily consistent) that satisfy the ℛ-condition, and let $\bar{R} C P C_{n}$ represent the set of n × n consistent pairwise comparison matrices that do not satisfy this condition.

3.1. Ranking loci in the ℛ-condition and non-consistent ranking

Since $ℝ_{+}^{*} - 1\}$ has two connected components, the set

R P C_{n} = {{(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in P C_{n} | i = j \Leftrightarrow a_{i, j} = 1}

has

2^{\frac{n (n - 1)}{2}}

connected components, which are characterized by the set of indices

I ({(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}) = {(i, j) \in ℕ_{n}^{2} | i < j and a_{i, j} > 1},

or equivalently by

J ({(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}) = I - ℕ_{n}^{2} = {(i, j) \in ℕ_{n}^{2} | i < j and a_{i, j} < 1} .

It is important to note that a consistent pairwise comparisons matrix does not uniquely define a family of weights (w_i)_{i∈ℕ_n}. However, a necessary and sufficient condition for obtaining a strict order w_σ(1) < ⋯ < w_σ(n), with the corresponding permutation σ ∈ 𝔖_n, is that

\forall (i, j) \in ℕ_{n}, i < j \Leftrightarrow \frac{w_{σ (i)}}{w_{σ (j)}} = a_{σ (i), σ (j)} < 1 .

This leads to the following definitions:

Definition 3.2

An admissible locus for strict ranking in ℛPC_n is one of its connected components constituted of matrices ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in P C_{n}$ such that:

\exists σ \in S_{n}, \forall (i, j) \in ℕ_{n}^{2}, i < j \Leftrightarrow a_{σ (i) σ (j)} < 1 .

In this definition, consistency is not assumed. Even with inconsistent comparisons, it is clear that the item indexed by σ(i) is ranked lower than the item indexed by σ(i+1) for each i ∈ ℕ_n−1, since a_{σ(i),σ(i+1)} < 1. Furthermore, this ranking property is preserved between the items indexed by σ(i) and σ(i+p) for i ∈ ℕ_n−1 and p ∈ ℕ_n−i, as we also have a_{σ(i),σ(i+p)} < 1. Hence, strict ranking appears to be unrelated to consistency in this approach, at least in a purely mathematical viewpoint. In other words, we have derived an order between items from a non-necessarily consistent PC matrix, as long as this matrix lies within an admissible locus for strict ranking in ℛPC_n.

Theorem 3.3

If n ≥ 3, there exists a bijection between 𝔖_n and the admissible loci in ℛPC_n.

Proof

We now analyse deeper Definition 3.2, and in particular the existence of a permutation σ ∈ 𝔖_n such that $\forall (i, j) \in ℕ_{n}^{2}$ , i < j ⇔ a_σ(i)σ(j) < 1.

We first make an observation. If two admissible matrices ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ and ${(b_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ are in the same locus, a_i,j < 1 ⇔ b_i,j < 1. Therefore, if σ ∈ 𝔖_n is such that

\forall (i, j) \in ℕ_{n}^{2}, i < j \Leftrightarrow a_{σ (i) σ (j)} < 1,

this is equivalent to state that

\forall (i, j) \in ℕ_{n}^{2}, i < j \Leftrightarrow b_{σ (i) σ (j)} < 1 .

In other words, Definition 3.2 defines a mapping from 𝔖_n to the set of admissible loci which is surjective.

Let $A = {(a_{i j})}_{(i, j) \in ℕ_{n}^{2}}$ be a PC matrix in an admissible locus. Let σ ∈ 𝔖_n related to A. We claim that this permutation σ is unique. Indeed, let us assume that there exists two such permutations σ and σ′, with σ ≠ σ′. Then ∀i ∈ ℕ_n−1, a_σ(i)σ(i+1) < 1 and a_{σ′(i)σ′(i+1)} < 1. Building by induction the weights

\begin{array}{l} w_{σ} (1) = 1, \\ w_{σ (i + 1)} = a_{σ (i + 1) σ (i)} w_{σ} (i), \end{array} and \begin{array}{l} w_{σ}^{'} (1) = 1, \\ w_{σ (i + 1)}^{'} = a_{σ (i + 1) σ (i)}^{'} w_{σ}^{'} (i), \end{array}

we get

\forall i < j, w_{σ (i)} < w_{σ (j)} and w_{σ (i)}^{'} < w_{σ (j)}^{'} .

Let k ∈ ℕ_n be the minimal element such that $w_{k} \neq w_{k}^{'}$ . This element existst because σ ≠ σ′, and w₁ = w′1 = 1 ⇒ k ≥ 2. Then

σ^{'} \circ σ^{- 1} (k) \notin ℕ_{k - 1}, σ \circ σ^{' - 1} (k) \notin ℕ_{k - 1}, and σ^{- 1} (k) \neq σ^{' - 1} (k) .

Therefore

either σ⁻¹(k)<σ′⁻¹(k) then σ^◦σ⁻¹(k) = k<σ^◦σ′(k) and a_{σ⁻¹(k)σ′⁻¹(k)} < 1. But now, $w_{σ 0 σ (k)}^{'} < w^{'} (k)$ and σ′ ◦ σ(k) ∉ ℕ_k−1, which is impossible.
or σ⁻¹(k) > σ′⁻¹(k) and the same arguments hold, exchanging σ and σ′, w and w′ in the previous item.

This shows that the existence of two distinct permutations σ and σ′ to a same matrix A in an admissible locus is impossible.

We conclude that the mapping from 𝔖_n to the set of admissible loci is injective, and hence bijective.

Definition 3.4

Let ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in P C_{n}$ . The characteristic ranking matrix of ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ is the additive, maybe inconsistent, PC matrix ${(c_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ where

c_{i, j} = sign (log (a_{i, j})) = \begin{array}{l} 0 & if & a_{i, j} = 1, \\ 1 & if & a_{i, j} > 1, \\ - 1 & if & 0 < a_{i, j} < 1 . \end{array}

The characteristic ranking matrix naturally characterizes the connected components of ℛPC_n, which justifies the terminology used.

Theorem 3.5

There exists a bijection between the set of charactristic matrices and the set of loci (not necessarily admissible) in ℛPC_n.

Proof

There is a bijection between 𝔖_n and all the possible rankings of n items. Given a ranking

w_{σ (1)} < \dots < w_{σ (n)},

we get the corresponding characteristic ranking matrix by

c_{i, j} = sign (log (w_{i}) - log (w_{j})) = sign (w_{i} - w_{j}) .

From this result, we deduce the following:

Theorem 3.6

For all n ≥ 3, there exists non-admissible loci in ℛPC_n.

Proof

The cardinality of 𝔖_n is n!, while the cardinality of loci in ℛPC_n is 2^n(n−1)/2. For n ≥3, n! ≠ 2^n(n−1)/2, so there is no bijection between 𝔖_n and loci in ℛPC_n. Therefore, by Theorem 3.3, the result follows.

Let us now analyze the case of 3 × 3 PC matrices with the ℛ-condition:

Theorem 3.7

Not all loci of ℛPC₃ are admissible loci. Among the 8 loci, 6 are admissible. The loci of ℛPC₃ that are not admissible are those matrices where a_1,3, a_2,1, and a_3,2 are simultaneously either in (1,+∞) or in (0, 1).

Proof

A PC-matrix in ℛPC₃ has:

its diagonal entries equal to 1,
three entries less than 1,
three entries bigger than 1.

We analyze characteristic ranking matrices. Let us check all cases:

For $(\begin{matrix} 0 & - 1 & - 1 \\ 1 & 0 & - 1 \\ 1 & 1 & 0 \end{matrix})$ , we get directly w₁ < w₂ < w₃.
For $(\begin{matrix} 0 & 1 & 1 \\ - 1 & 0 & 1 \\ - 1 & - 1 & 0 \end{matrix})$ , the permutation σ = ( 1 3 ) gives w₃ < w₂ < w₂.
By the action of σ = ( 1 2 ) and σ′ = ( 2 3 ) on $(\begin{matrix} 0 & - 1 & - 1 \\ 1 & 0 & - 1 \\ 1 & 1 & 0 \end{matrix})$ , we get respectively the matrices $(\begin{matrix} 0 & 1 & - 1 \\ - 1 & 0 & - 1 \\ 1 & 1 & 0 \end{matrix})$ and $(\begin{matrix} 0 & - 1 & - 1 \\ 1 & 0 & 1 \\ 1 & - 1 & 0 \end{matrix})$ , which shows that the corresponding loci are admissible.
By the action of the cyclic permutations σ = ( 1 2 3 ) and σ′ = ( 1 3 2 ) on $(\begin{matrix} 0 & - 1 & - 1 \\ 1 & 0 & - 1 \\ 1 & 1 & 0 \end{matrix})$ , we get respectively the matrices $(\begin{matrix} 0 & - 1 & 1 \\ 1 & 0 & 1 \\ - 1 & - 1 & 0 \end{matrix})$ and $(\begin{matrix} 0 & 1 & 1 \\ - 1 & 0 & - 1 \\ - 1 & 1 & 0 \end{matrix})$ , which shows that the corresponding loci are admissible.
There are two loci not attained by the action of 𝔖₃, which are represented by $(\begin{matrix} 0 & 1 & - 1 \\ - 1 & 0 & 1 \\ 1 & - 1 & 0 \end{matrix})$ and $(\begin{matrix} 0 & - 1 & 1 \\ 1 & 0 & - 1 \\ - 1 & 1 & 0 \end{matrix})$ .

We now proceed to analyze the impact of consistency on the admissibility of the loci.

3.2. Unstability of ℛPC_n under procedures making consistent a PC matrix

Let us examine the effect of a consistency procedure, specifically the orthogonal projection method, on ranking. This method allows us to obtain consistent PC matrices that may or may not preserve the ℛ-condition. Specifically, we examine whether the chosen procedure making consistent a PC matrix can move a matrix from ℛPC_n to a matrix that no longer satisfies the ℛ-condition. For simplicity, we apply this procedure to a selected consistency method described in [13, 14].

Theorem 3.8

Let ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in P C_{n}$ and ${(b_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in C P C_{n}$ be the consistent PC matrix obtained from ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ by the orthogonal projection method. Then:

The matrix ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ may satisfy the ℛ-condition, while ${(b_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in \bar{R} C P C_{n}$ .
The matrix ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ may satisfy the ℛ-condition and belong to an admissible locus, while ${(b_{i, j})}_{(i, j) \in ℕ_{n}^{2}} \in \bar{R} C P C_{n} .$ .
The matrix ${(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ may satisfy the ℛ-condition and belong to an admissible locus, while ${(b_{i, j})}_{(i, j) \in ℕ_{n}^{2}}$ also satisfies the ℛ-condition but belongs to a different admissible locus.

Proof

We produce all the announced counter-examples in PC₃. Let us now produce our counter-examples.

Let us consider the PC matrix
$(\begin{matrix} 1 & e & e^{- 1} \\ e^{- 1} & 1 & e \\ e & e^{- 1} & 1 \end{matrix}) .$

It satisfies the ℛ-condition but it is not in an admissible locus. The matrix obtained is
$(\begin{matrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{matrix}),$
which does not satisfy the ℛ-condition.
Let us consider the PC matrix
$(\begin{matrix} 1 & e & e^{3} \\ e^{- 1} & 1 & e^{- 1} \\ e^{- 3} & e & 1 \end{matrix}) .$

It satisfies the ℛ-condition and it is in an admissible locus. The matrix obtained is
$(\begin{matrix} 1 & 1 & 1 \\ 1 & 1 & e^{- 2} \\ 1 & e^{2} & 1 \end{matrix}),$
which does not satisfy the ℛ-condition.
Let us consider the PC matrix
$(\begin{matrix} 1 & e & e^{- 9} \\ e^{- 1} & 1 & e^{- 4} \\ e^{- 9} & e^{4} & 1 \end{matrix}) .$

It satisfies the ℛ-condition and its characteristic ranking matrix is
$(\begin{matrix} 0 & 1 & - 1 \\ - 1 & 0 & - 1 \\ 1 & 1 & 0 \end{matrix}) .$

The matrix obtained is

(\begin{matrix} 1 & e^{- 1} & e^{- 7} \\ e & 1 & e^{- 6} \\ e^{7} & e^{7} & 1 \end{matrix}),

and its characteristic ranking matrix is

(\begin{matrix} 0 & - 1 & - 1 \\ 1 & 0 & - 1 \\ 1 & 1 & 0 \end{matrix}),

which shows that we have changed of admissible locus during the procedure making consistent a PC matrix.

4. On a procedure leading to strict ranking

We have seen that an existing procedure making consistent a PC matrix is not adapted to the conservation of the characteristic ranking matrix. We now propose a method that will always produce a consistent PC matrix satisfying the ℛ-condition, and consequently, a consistent PC matrix that will produce a strict ranking of the items. For this, we have to exclude from the initial set of pairwise comparisons matrices the set $\bar{R} C P C_{n}$ of the study. Indeed, on this set, there is no need of procedures making consistent a PC matrix, and there are already items that have equal rank. Therefore, we work in the set of admissible pairwise comparisons matrices defined by

A P C_{n} = P C_{n} - \bar{R} C P C_{n} .

We propose to build a functional

Φ : A P C_{n} \to ℝ_{+}

such that a PC matrix A is consistent and satisfies the ℛ-condition if and only if

Φ (A) = 0 .

Remark 4.1

Inconsistency indicators [12] have the same kind of property: given ii an inconsistency indicator, the PC matrix A is consistent if and only if ii(A) = 0.

Theorem 4.2

Let ii be an inconsistency indicator. The map

Φ : A P C_{n} \to ℝ

defined by

\begin{array}{l} Φ ({(a_{i, j})}_{(i, j) \in ℕ_{n}^{2}}) \\ = (\prod_{(i, j) \in ℕ_{n}^{2}, i < j} \frac{i i (A)}{{(log (a_{i, j}))}^{2} + {(i i (A))}^{n (n + 1) / 2}}) \sum_{(i, j) \in ℕ_{n}^{2}, i < j} ({(log (a_{i, j}))}^{4} + 1) \end{array}

is a functional

with domain equal to 𝒜PC_n,
which is ℝ₊-valued,
which vanishes only on consistent PC matrices that satisfy the ℛ-condition.

Proof

Since ii is ℝ₊-valued, then Φ is ℝ₊-valued. Let us now prove the main difficulty of the theorem, namely:

if A ∈ PC_n, A ∉ 𝒜PC_n, then Φ(A) is not well-defined,
if A ∈ 𝒜PC_n, Φ(A) = 0 ⇔ A ∈ CPC_n.

For this, we first remark that

\sum_{(i, j) \in ℕ_{n}^{2}, i < j} ({(log (a_{i, j}))}^{4} + 1) \geq \frac{n (n - 1)}{2} .

For the first factor, let us analyze one case after another.

If A ∉ 𝒜PC_n,, then $A \in \bar{R} C P C_{n}$ , this implies that
$\begin{array}{l} i i (A) = 0, \\ \exists (i, j) \in ℕ_{n}^{2}, i < j and log (a_{i}, j) = 0, \end{array}$
therefore at least one of the factors of the product
$\prod_{(i, j) \in ℕ_{n}^{2}, i < j} \frac{i i (A)}{{(log (a_{i, j}))}^{2} + {(i i (A))}^{n (n + 1) / 2}}$
is ill defined (roughly speaking, of the type $\frac{0}{0}$ ). Let us now assume that there is only one coefficient a_i,j such that log a_i,j = 0. Then
$\begin{array}{l} \prod_{\underset{i < j}{(i, j) \in {1, \dots, n}^{2}}} \frac{ii (A)}{{(log a_{i, j})}^{2} + {(ii (A))}^{\frac{n (n + 1)}{2}}} \\ = (\prod_{\underset{k < l, (k, l) \neq (i, j)}{(k, l) \in {1, \dots, n}^{2}}} \frac{1}{{(log a_{k, l})}^{2}}) (\frac{{(ii (A))}^{\frac{n (n - 1)}{2}}}{{(ii (A))}^{\frac{n (n + 1)}{2}}}) = \frac{C}{ii (A)}, \\ where C = \prod_{\underset{k < l, (k, l) \neq (i, j)}{(k, l) \in {1, \dots, n}^{2}}} \frac{1}{{(log a_{k, l})}^{2}} \in ℝ_{+}^{*} . \end{array}$
Therefore, if there is only one term a_i,j such that a_i,j = 1, then Φ(A) is not well defined.
The same holds if more coefficients are equal to 1: by the same reasoning, if K > 1 is the number of off-diagonal coefficients a_i,j equal to 1 in A, then
$\prod_{\underset{i < j}{(i, j) \in {1, \dots, n}^{2}}} \frac{ii (A)}{{(log a_{i, j})}^{2} + {(ii (A))}^{\frac{n (n + 1)}{2}}} = \frac{C^{'}}{{(i i (A))}^{\frac{K n (n + 1) - n (n - 1)}{2}}},$
with $C^{'} \in ℝ_{+}^{*}$ . This shows that Φ(A) is not defined whenever A ∉ 𝒜PC_n.
If A ∈ 𝒜PC_n − CPC_n, then ii(A) > 0 therefore Φ(A) is well-defined and Φ(A) > 0.
If A ∈ 𝒜PC_n ∩ CPC_n, then $\forall (i, j) \in ℕ_{n}^{2}$ , i < j ⇒ ai,j ≠ 1. Therefore, on one side, $\sum_{(i, j) \in ℕ_{n}^{2}, i < j} ({(log (a_{i, j}))}^{4} + 1) > \frac{n (n - 1)}{2} > 0$ . On the other side, each factor of the product $\prod_{(i, j) \in ℕ_{n}^{2}, i < j} \frac{i i (A)}{{(log (a_{i, j}))}^{2} + {(i i (A))}^{n (n + 1) / 2}}$ is well defined and reads as $\frac{0}{log {(a_{i j})}^{2}} = 0$ which shows that Φ(A) = 0.

This ends the proof.

Remark 4.3

If (A_n) is a sequence of (non consistent) PC matrices such that every (1, 2) coefficient is equal to 1, and such that lim ii(A_n) = 0 then lim Φ(A_n) = +∞ by the calculations led in last proof. This seems to indicate that the mapping Φ, which is obviously continuous and piecewise smooth on 𝒜PC_n if ii is continuous and piecewise smooth on PC_n, is divergent at the neighborhood of $\bar{R} C P C_{n}$ . The same way, on another sequence (B_n) in 𝒜PC_n, if ii(B_n) is constant and strictly positive, and if only the (1,2)-term diverges to +∞, then Φ(B_n) = O((log(b_1,2))²) therefore lim Φ(B_n) = +∞. These short informal computations enable us to conjecture that most minimization algorithms applied to Φ will converge to a consistent PC matrix with strict ranking, without generating divergent sequences.

Within this functional, most classical procedures making consistent a PC matrix fail to be generalized to a concrete method leading to its minimization, except the gradient method which may produce an efficient approach, adapting the work [22] initially developed on inconsistency indicators to the map Φ. The full study of the functional Φ, its regularity, and the corresponding gradient method is out of the scope of this paper and is left as an open question.

5. Conclusion

In this work, we proposed a ranking method on a PC matrix satisfying the ℛ-condition without assuming consistency. This change of paradigm, compared to classical procedures, seemingly produce an uncompatible approach with the search for consistency, or at least an uncompatible approach with some methods, for which we proved that the ranking is violated by the procedures making a PC matrix consistent. After these investigations, we defined a functional Φ that, when equal to zero, guarantees both the consistency of the PC matrix and the satisfaction of the ℛ-condition. Finally, the in-depth study of the functional Φ and the associated optimization methods remains an open question.

But let us try to understand better what is psychologically underlying the concepts of rankings and consistency. Ranking intends to produce preferences, while the requirement of (at least approximate) consistency is required by the necessary coherence of assessments. However, the human mind does not make rankings by numbers, but more by fuzzy (linguistic) values that are difficult to universally traduce into numbers (see e.g. [23]). Therfore, more than a consistent ranking obtained by an arbitrarily chosen procedure, maybe a more complex structure than $ℝ_{+}^{*}$ is required for evaluation in human-related problems, while numbers are sufficient for e.g. wireless technologies. This refinement of viewpoint may split the PC method, actually so widely spread, to refined, specialized approaches adapted to complex problems, in particular to those with psychological issues. The principal bundle approach with non-abelian Lie groups [20], and more deeply with some of their generalizations, potentialy propose such a setting, even if our own opinion is quite pessimistic for such a goal since the human mind is still far from being modelized efficiently (at least to our best knowledge).

Appendices

Appendix: On finite configuration spaces

Following [7, 18], we set a locally compact manifold N, identified with the set of Dirac measures {δ_x | x ∈ N}. Let I be a set of indexes that is assumed here to be a finite subset of ℕ (typically, I = ℕ_k = {1, ⋯, k}). We define the ordered configuration spaces.

\begin{array}{l} O Γ^{k} = (x_{1}, \dots x_{k}) \in N^{k} such that, if i \neq j, x_{i} \neq x_{j}\}, \\ O Γ = \underset{k \in ℕ^{*}}{∐} O Γ^{k} . \end{array}

The general configuration spaces are not ordered. For k ∈ ℕ^∗, let 𝔖_k be the group of bijections on ℕ_k = {1, ⋯ , k}. We can define the action:

\begin{array}{l} S_{k} \times O Γ^{k} \to O Γ^{k} \\ (σ, (x_{1}, \dots x_{k})) \mapsto (x_{σ (1)}, \dots x_{σ (k)}) . \end{array}

Then, we define general configuration spaces:

Γ^{k} = O Γ^{k} / S_{k} and Γ = \underset{k \in ℕ^{*}}{∐} Γ^{k} .

The manifold O‘Γ is a k!-covering of the manifold Γ and moreover:

O‘Γ_n is isomorphic to Γⁿ × 𝔖_n if N = ℝ,
if n is connected and dim(N) > 1, the covering
$π_{O} : O Γ^{k} \to Γ^{k}$
is non trivial.

Since OΓ^k is an open subset of N^k, for any (x₁, ⋯, x_k) ∈ OΓ^k, we have that

T_{(x_{1}, \dots, x_{k})} O Γ^{k} = T_{x_{1}} N \times \dots \times T_{x_{k}} N

and, by the 𝔖_k-covering of Γ^k already defined, we also get that, ∀x ∈ Γ^k,

T_{x} Γ^{k} = T_{x_{1}} N \times \dots \times T_{x_{k}} N

where π_O(x₁, ⋯, x_k) = x. Let us now concentrate our efforts on N = ℝⁿ, equipped with its natural (constant) Riemannian metric (or Euclidian scalar product) g with Euclidian norm || · ||.

Definition 5.1

We define the following metric on OΓ^k :

g_{(x_{1}, \dots, x_{k})} ((v_{1}, \dots, v_{k}), (v_{1}^{'}, \dots, v_{k}^{'})) = {(\sum_{(i, j) \in ℕ_{k}^{2}} \frac{1}{{x_{i} - x_{j}‖}^{2}})}^{2} \sum_{l \in ℕ_{k}} g (v_{l}, v_{l}^{'}) .

This metric has the interesting property to be 𝔖_k-invariant, and hence to be also a Riemannian metric on Γ. Moreover,

Proposition 5.2

Let γ ∈ C^∞(ℝ,N^k) such that

\forall t < 1, γ (t) \in O Γ^{k} a n d γ (1) \notin O Γ^{k} .

Denoting Lγ(t) the length oγ on [0, t] for t < 1 and for the Riemannian metric g_O, we have

lim_{t \to 1^{-}} L γ (t) = + \infty .

Proof

Since γ is smooth on ℝ, we can assume that $\dot{γ}|| = 1$ and we have that

\int_{0}^{1} \sqrt{g_{O} (\dot{γ} (t), \dot{γ} (t))} d t

is a divergent improper integral.

Remark 5.3

This Riemannian metric on OΓ^k is directly inspired from the hyperbolic metric on the Poincaré disk [9]. To our best knowledge, and to our great surprise, this metric has never been defined and studied, neither in a published paper nor in any preprint available online. We suspect an interesting hyperbolic geometry related to this Riemannian metric, but we leave this differential geometric study as an open question.

Acknowledgements

J.-P.M. thanks the France 2030 framework programme Centre Henri Lebesgue ANR-11-LABX-0020-01 for creating an attractive mathematical environment.

On Strict Ranking by Pairwise Comparisons

Full Article

1. Introduction

2. Preliminaries

Remark 2.1

2.1. From multiplication to addition: A key approach for making a PC matrix consistent

2.2. Lie theory and loop quantum gravity: Insights into pairwise comparison matrices

3. Strict ranking, related sets of weights, and pairwise comparisons

(1)

Definition 3.1.

3.1. Ranking loci in the ℛ-condition and non-consistent ranking

Definition 3.2

Theorem 3.3

Proof

Definition 3.4

Theorem 3.5

Proof

Theorem 3.6

Proof

Theorem 3.7

Proof

3.2. Unstability of ℛPC_n under procedures making consistent a PC matrix

Theorem 3.8

Proof

4. On a procedure leading to strict ranking

Remark 4.1

Theorem 4.2

Proof

Remark 4.3

5. Conclusion

Appendices

Appendix: On finite configuration spaces

Definition 5.1

Proposition 5.2

Proof

Remark 5.3

Acknowledgements

Paradigm

My account

On Strict Ranking by Pairwise Comparisons

Full Article

1. Introduction

2. Preliminaries

Remark 2.1

2.1. From multiplication to addition: A key approach for making a PC matrix consistent

2.2. Lie theory and loop quantum gravity: Insights into pairwise comparison matrices

3. Strict ranking, related sets of weights, and pairwise comparisons

(1)

Definition 3.1.

3.1. Ranking loci in the ℛ-condition and non-consistent ranking

Definition 3.2

Theorem 3.3

Proof

Definition 3.4

Theorem 3.5

Proof

Theorem 3.6

Proof

Theorem 3.7

Proof

3.2. Unstability of ℛPCn under procedures making consistent a PC matrix

Theorem 3.8

Proof

4. On a procedure leading to strict ranking

Remark 4.1

Theorem 4.2

Proof

Remark 4.3

5. Conclusion

Appendices

Appendix: On finite configuration spaces

Definition 5.1

Proposition 5.2

Proof

Remark 5.3

Acknowledgements

3.2. Unstability of ℛPC_n under procedures making consistent a PC matrix