V originále
Given n objects, such as variants from which the best one with respect to some criterion is to be selected or which are to be ranked from the best one to the worst one, a pairwise comparison matrix is obtained when the decision-maker considers various pairs of the objects and judges the objects in the pair relatively with respect to the criterion. In this paper, we follow the general unified framework by Cavallo and D’Apuzzo (2009) and assume that the relative importance of the objects is evaluated by using elements of a given divisible Abelian linearly ordered group (alo-group). To obtain the priority vector of the resulting pairwise comparison matrix, we get inspired by the notion of nucleolus (Schmeidler, 1969), which is a well-known solution concept of a cooperative game with transferable utility, and propose a new nucleolus-like method to find the priority vector of the given pairwise comparison matrix. The method utilizes the theory of linear programming in abstract spaces (Bartl, 2007).