Transitive matrices, strict preference and intensity operators

Let X be a set of alternatives and a_{ij} a positive number expressing how much the alternative x_{i} is preferred to the alternative x_{j}. Under suitable hypothesis of no indifference and transitivity over the pairwise comparison matrix A= (a_{ij}), the alternatives can be ordered as a chain . Then a coherent priority vector is a vector giving a weighted ranking agreeing with the obtained chain and an intensity vector is a coherent priority vector encoding information about the intensities of the preferences. In the paper we look for operators F that, acting on the row vectors translate the matrix A in an intensity vector.