Exact bounds for efficient consistent matrices obtained from a reciprocal matrix

For a given reciprocal matrix A, we give a union of matrix intervals in which any consistent matrix obtained from an efficient vector for A lies, and, conversely, any consistent matrix in this union comes from an efficient vector for A. The maximal sets of entries in the lower and upper bound matrices of each interval that are attainable by some consistent matrix in the interval are described. This allows us to understand which subsets of the alternatives lie above which other subsets in all efficient orders for each interval. As a result, the partial order on the alternatives dictated by the efficient vectors follows. Then, we use the tools developed to also show that, when the n-by-n reciprocal matrices A,B are simple perturbed consistent matrices, or n=4, the sets of efficient vectors for A and B coincide only if A=B.