WorksMathematics
Efficient orders for reciprocal matrices with block structure
Abstract
We consider block partitioned reciprocal matrices. For these matrices, we characterize the efficient vectors whose subvectors, corresponding to principal blocks, are positive multiples of given efficient vectors for those blocks. This generalizes a prior, scalar oriented, extension theorem. Conditions are presented that guarantee the existence of efficient vectors that preserve ordinal relations associated with cross-block comparisons. The notion of order transitivity is also generalized to block reciprocal matrices. For such matrices, it is then shown that efficient vectors, with no rank reversals in positions corresponding to off-diagonal blocks, exist. The notion of uniformly ordered reciprocal matrices (all efficent vectors exhibit the same order) is also generalized in the block reciprocal setting. This class is characterized via known matrix bounds for the consistent matrices associated with efficient vectors. We also provide a graph-theoretic characterization of the existence of a positive vector that is efficient for all completions of a given partial reciprocal matrix. Based on this, we apply some of our results on ordering to such matrices.