Reciprocal transitive matrices over abelian linearly ordered groups: Characterizations and application to multi-criteria decision problems
Introduction
The quantitative pairwise comparisons are a useful tool for estimating the relative weights on a set of decision elements such as criteria or alternatives. Pairwise comparisons can be modelled by a quantitative preference relation on X: where quantifies the preference intensity of over . When the cardinality of X is small, can be represented by the Pairwise Comparison Matrix (PCM)
In literature, several kinds of PCMs are considered: if represents a preference ratio, then is a multiplicative preference relation and A a multiplicative PCM; if represents a preference difference, then is an additive preference relation and A an additive PCM; if reflects a preference degree, then is called fuzzy preference relation [11], [14] and, as a consequence, A can be called fuzzy PCM.
A condition of reciprocity is assumed for PCMs, for which the information provided by , can be exactly deduced from .
If the expert is fully coherent when expresses his preferences, then the PCM satisfies the consistency condition; several kinds of consistency are proposed in literature: multiplicative consistency [19], additive consistency [1], fuzzy additive consistency (called additive transitivity in [12], [21]), and fuzzy multiplicative consistency (called multiplicative transitivity in [12], [20]).
Many authors have studied the problem of the inconsistency of a PCM, for instance: Saaty [18] proposes a consistency index defined in terms of the principal eigenvalue; Barzilai [1] proposes the relative error; Peláez and Lamata [16] propose a measure of consistency based on the determinant of the PCM; Bortot and Marques Pereira [4] propose a measure of dominance inconsistency in the framework of Choquet integration; Brunelli and Fedrizzi [5] present five axioms aimed at characterizing inconsistency indices.
In order to unify different approaches to the PCMs and remove some drawbacks, in [6] the authors introduce PCMs over an abelian linearly ordered group (alo-group) . In this general context, conditions of ⊙-reciprocity and ⊙-consistency are proposed. In [6], if is divisible, then a mean operator is associated with ⊙, and a ⊙-consistency index (see [9] for its properties) is defined.
The preference relation induces a qualitative preference structure on X [8]: where means “ preferred to ” and means “ indifferent to ”, and e is the identity of the group operation ⊙.
By relations ≻ and ∼, we obtain the relation ≿ defined as follows: If , then we say “ is weakly preferred to ”.
The transitivity of the relations in (2) and (3) is the minimal logical requirement and a fundamental principle that preference relations should satisfy; the transitivity is in fact acyclic about the alternatives or criteria ranking. Unfortunately, if the PCM is not ⊙-consistent, then it may happen that these relations are not transitive; thus, the need to consider PCMs that ensure the transitivity of relations in (2) and (3).
In this paper, we focus on ⊙-reciprocal matrices over a divisible alo-group and, in this general context, we introduce the notion of ⊙-transitivity that is equivalent to weak transitivity introduced in [21] for fuzzy preference relations, and generalizes the transitivity given in [2] and [3] for multiplicative matrices, under the assumption of no indifference (i.e. for ). The ⊙-transitivity ensures transitivity of the relations in (2) and (3); thus, it allows us to determine the actual dominance ranking on X and ordinal evaluation vectors for this ranking
For conditions ensuring transitive collective decisions, see [15].
The paper is organized as follows: in Section 2, we introduce the notation and definitions used in the paper; in Section 3, we provide the notion of ⊙-transitivity; in Section 4, we assume that is a PCM associated with a set X of decision elements, and show that the ⊙-transitivity allows us to state the actual ranking on X; in Section 5, we analyze the notion of ⊙-transitivity and provide characterizations, that allow us to easily check the ⊙-transitivity, to state the actual ranking on X and to obtain ordinal evaluation vectors; finally, in Section 6 we provide concluding remarks and directions for future work.
Section snippets
Preliminaries
From now on, G will denote an open interval of the real line , ≤ the total order on G inherited from the usual order on , a divisible alo-group, e the identity of , the symmetric of with respect to ⊙, ÷ the inverse operation of ⊙ defined by , , for a non-negative integer n, the (n)-power of and , that is the unique solution of the equation , the (n)-root of a (see [6]).
By definition of alo-group, the following implication holds:
⊙-transitive RMs
From now on, let us assume be an RM over .
Definition 3.1 is ⊙-transitive if and only if verifies the condition
If is a fuzzy RM, then (16) corresponds to weak transitivity introduced in [21], that is: whereas if is a multiplicative RM, (16) generalizes the transitivity given in [2] and [3] for a multiplicative matrix, under the assumption for , that is:
Theorem 3.1 The following assertions are equivalent: is ⊙
⊙-transitive PCMs and actual ranking on X
Let be the ⊙-reciprocal PCM associated with the set of decision elements, and ≻, ∼ the binary relations on X described by (2). By the meaning given to in Section 1, we say that (10) is a condition of no indifference between distinct objects of X.
Proposition 4.1 The relation ≻ is asymmetric, the relation ∼ is reflexive and symmetric and The relation ≿ is strongly complete, that is:
Proof By (2) and (12), ≻ is asymmetric and ∼
Characterizations of the ⊙-transitivity
In this section, we show that, to check the ⊙-transitivity condition, it is enough to count, for each row of an RM, the number of components greater than e, or equal to e, and then verify whether a suitable relation among them is satisfied.
Let us denote with the cardinality of a finite set Y, then we introduce the following integer numbers:
- •
;
- •
;
- •
.
If
Conclusion and future work
We analyze a condition of ⊙-transitivity for a ⊙-reciprocal matrix over an alo-group, that allows us to state the actual ranking on a set of alternatives X, whenever is a PCM for X. We provide tools to check the ⊙-transitivity, and find the actual ranking and ordinal evaluation vectors.
Finally, we stress that although both matrix in Example 4.1 and matrix in Example 5.5 are ⊙-transitive and no ⊙-consistent, the ⊙-mean vector is an ordinal evaluation vector only in Example
References (21)
- et al.
Inconsistency and non-additive capacities: the analytic hierarchy process in the framework of Choquet integration
Fuzzy Sets Syst.
(2013) - et al.
Integrating three representation models in fuzzy multipurpose decision making based on fuzzy preference relations
Fuzzy Sets Syst.
(1998) - et al.
Some issue on consistency of fuzzy preferences relations
Eur. J. Oper. Res.
(2004) - et al.
Collective transitivity in majorities based on difference in support
Fuzzy Sets Syst.
(2013) - et al.
A new measure of consistency for positive reciprocal matrices
Comput. Math. Appl.
(2003) A scaling method for priorities in hierarchical structures
J. Math. Psychol.
(1977)Fuzzy preference orderings in group decision making
Fuzzy Sets Syst.
(1984)Consistency measures for pairwise comparison matrices
J. Multi-Criteria Decis. Anal.
(1998)- et al.
Ranking and weak consistency in the A.H.P. context
Decis. Econ. Finance
(1997) - et al.
Weak consistency and quasi-linear means imply the actual ranking
Int. J. Uncertain. Fuzziness Knowl.-Based Syst.
(2002)
Cited by (33)
A comparative study on distance-based inconsistency indices defined over Abelian linearly ordered groups
2023, Fuzzy Sets and SystemsA novel perspective on the inconsistency indices of reciprocal relations and pairwise comparison matrices
2023, Fuzzy Sets and SystemsNote on “The breaking of additively reciprocal property of fuzzy preference relations and its implication to decision making under uncertainty”
2022, Information SciencesCitation Excerpt :Frameworks of fuzzy preference relations (FPRs) and multiplicative preference relations are generally utilized representation tools for quantifying preferences of compared objects [3,10]. When the framework of FPRs is combined with the analytic hierarchy process [13], the elements in an FPR are required to satisfy additive reciprocity [2,11,14]. Therefore, FPRs with additive reciprocity are often called reciprocal preference relations [6] or additive reciprocal FPRs (ARFPRs).
The breaking of additively reciprocal property of fuzzy preference relations and its implication to decision making under uncertainty
2021, Information SciencesCitation Excerpt :Except for the consistency indexes, it is interesting to construct the indexes for quantifying the transitivity properties of ARMs [4,27,26,44]. One can find that the ordinal consistency index of ARMs has been given in [44], where the concept of ordinal consistency is equivalent to weak transitivity [7]. A transitivity index has been proposed using the distance between an(a) additive(multiplicative) PCM without transitivity and a set of additive(multiplicative) PCMs with transitivity in [4].
Preservation of preferences intensity of an inconsistent Pairwise Comparison Matrix
2020, International Journal of Approximate ReasoningDistance-based measures of incoherence for pairwise comparisons
2020, Knowledge-Based Systems