2025
A New Nucleolus-Like Method to Find the Priority Vector of a Pairwise Comparison Matrix
BARTL, DavidBasic information
Original name
A New Nucleolus-Like Method to Find the Priority Vector of a Pairwise Comparison Matrix
Authors
Edition
Karviná, The 5th International conference on Decision making for Small and Medium-Sized Enterprises, p. 13-20, 8 pp. 2025
Publisher
Silesian University in Opava, School of Business Administration in Karviná
Other information
Language
English
Type of outcome
Proceedings paper
Field of Study
10102 Applied mathematics
Country of publisher
Czech Republic
Confidentiality degree
is not subject to a state or trade secret
Publication form
electronic version available online
Marked to be transferred to RIV
Yes
RIV identification code
RIV/47813059:19520/25:A0000552
Organization unit
School of Business Administration in Karvina
ISBN
978-80-7510-610-0
Keywords in English
pairwise comparison matrix; priority vector; alo-group; nucleolus; cooperative TU-game
Tags
Tags
International impact, Reviewed
Changed: 22/3/2026 17:42, doc. RNDr. David Bartl, Ph.D.
Abstract
In the original language
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).