Q2. What is the value of a complete preorder?
Let R ∈ W (X) be a complete preorder on X, a codified complete preorder is a real-valued vector MR = (m1, . . . ,mk) where mj represents the codification value corresponding to alternative xj.
Q3. What is the objective function of the minimization problem?
Whatever the statement of the minimization problem, the objective function is restricted to feasible codified vectors, which emphasizes the importance of their characterization for the canonical codification procedure.
Q4. What is the first author to manage ordinal preferences?
In the literature several procedures to codify linear and complete preorders into numerical values can be found (see [8], [7], [14] and [25], among others), Borda [8] being the first author to manage ordinal preferences in such way.
Q5. Why should it be relevant to dispose of a consistent codification procedure?
Due to the importance of the choice of the codification procedure to accomplish any methodology over ordinal information, it should be relevant to dispose of a consistent codification procedure.
Q6. What is the main source of uncertainty in the Mahalanobis dissensus measures?
In order to analize the properties of the Mahalanobis dissensus measures, it seems reasonable that the authors initially explore if these measures satisfy anonymity and neutrality, that is, if the Mahalanobis dissensus measures are normal dissensus measures and then the rest of their properties.
Q7. What is the spectral decomposition of the matrix?
Consider the spectral decomposition of the matrix Σ = ΓtDλΓ where Γ and Dλ contain eigenvectors (by columns) and the corresponding eigenvalues of Σ as diagonal elements, respectively.
Q8. What is the value of the MR?
In order to simplify the notation and due to the equivalence among the set of complete preorders and the set of their permutations, the authors can write πMR for some MR.
Q9. What is the meaning of the word monotone non-decreasing?
Cook and Seiford [14] formalized the so-called monotone non-decreasing property for the case of the Minimum Variance method in order to realize the potential of the alignment between the average point and the ranking that minimizes the Euclidean distance.
Q10. What is the correlation between the alternatives?
Since Σ matrix can be considered as a variance-covarince matrix in the Mahalanobis distance, it is easy to compute the corresponding correlation matrix Corr, that is, the correlation among the alternatives.
Q11. What is the canonical codified complete preorder?
Definition 1. The canonical codified complete preorder associated with R ∈ W (X) is defined by the numerical vector KR = (c1, ..., ck) ∈ ({1, . . . , k})k where cj = |{q : xj <R xq}| and therefore cj accounts for the number of alternatives that are graded at most as good as xj.