On the Derivation of Weights from Incomplete Pairwise Comparisons Matrices via Spanning Trees with Crisp and Fuzzy Confidence Levels
arXiv:2112.10253 · doi:10.1016/j.ijar.2022.08.014
Abstract
In this paper, we propose a new method for the derivation of a priority vector from an incomplete pairwise comparisons (PC) matrix. We assume that each entry of a PC matrix provided by an expert is also evaluated in terms of the expert's confidence in a particular judgment. Then, from corresponding graph representations of a given PC matrix, all spanning trees are found. For each spanning tree, a unique priority vector is obtained with the weight corresponding to the confidence levels of entries that constitute this tree. At the end, the final priority vector is obtained through an aggregation of priority vectors achieved from all spanning trees. Confidence levels are modeled by real (crisp) numbers and triangular fuzzy numbers. Numerical examples and comparisons with other methods are also provided. Last, but not least, we introduce a new formula for an upper bound of the number of spanning trees, so that a decision maker gains knowledge (in advance) on how computationally demanding the proposed method is for a given PC matrix.
arXiv comment25 pages, 7 figures
References in corpus (6)
- The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
- Inconsistency in the ordinal pairwise comparisons method with and without ties
- A general unified framework for interval pairwise comparison matrices
- On the geometric mean method for incomplete pairwise comparisons
- When is the condition of order preservation met?
- Satisfaction of the Condition of Order Preservation: A Simulation Study