A New Nucleolus-Like Method to Find the Priority Vector of a Pairwise Comparison Matrix

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F25%3AA0000552" target="_blank" >RIV/47813059:19520/25:A0000552 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.researchgate.net/publication/392732680_A_New_Nucleolus-Like_Method_To_Find_the_Priority_Vector_of_a_Pairwise_Comparison_Matrix" target="_blank" >https://www.researchgate.net/publication/392732680_A_New_Nucleolus-Like_Method_To_Find_the_Priority_Vector_of_a_Pairwise_Comparison_Matrix</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A New Nucleolus-Like Method to Find the Priority Vector of a Pairwise Comparison Matrix

Popis výsledku v původním jazyce

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).

Název v anglickém jazyce

A New Nucleolus-Like Method to Find the Priority Vector of a Pairwise Comparison Matrix

Popis výsledku anglicky

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).

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

The 5th International conference on Decision making for Small and Medium-Sized Enterprises

ISBN

9788075106100

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

13-20

Název nakladatele

Silesian University in Opava, School of Business Administration in Karviná

Místo vydání

Karviná

Místo konání akce

Karviná

Datum konání akce

22. 5. 2025

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—