Fernandes, RosárioPalheira, Susana2025-02-122025-02-122024-070888-613XPURE: 107371818PURE UUID: 2402b0fa-7924-49fb-8e98-3c2dc018edc7Scopus: 85190848216ORCID: /0000-0003-2695-9079/work/177968420http://hdl.handle.net/10362/178919Publisher Copyright: © 2024 The Author(s)Let A be a pairwise comparison matrix obtained from a consistent one by perturbing three entries above the main diagonal, x,y,z, and the corresponding reciprocal entries, in a way that there is a submatrix of size 2 containing the three perturbed entries and not containing a diagonal entry. In this paper we describe the relations among x,y,z with which A always has its principal right eigenvector efficient. Previously, and only for a few cases of this problem, R. Fernandes and S. Furtado (2022) proved the efficiency of the principal right eigenvector of A. In this paper, we continue to use the strong connectivity of a certain digraph associated with A and its principal right eigenvector to characterize the vector efficiency. For completeness, we show that the existence of a sink in this digraph is equivalent to the inefficiency of the principal right eigenvector of A.537193engConsistent matrixDecision processesPairwise comparison matrixPrincipal eigenvector efficiencyStrongly connected digraphSoftwareTheoretical Computer ScienceApplied MathematicsArtificial Intelligencejournal article10.1016/j.ijar.2024.109204https://www.scopus.com/pages/publications/85190848216