Přehled o publikaci
2023
A Consensual Coherent Priority Vector of Pairwise Comparison Matrices in Group Decision-Making
BARTL, David a Jaroslav RAMÍKZákladní údaje
Originální název
A Consensual Coherent Priority Vector of Pairwise Comparison Matrices in Group Decision-Making
Autoři
BARTL, David a Jaroslav RAMÍK
Vydání
Book of Abstracts of the 41st International Conference on Mathematical Methods in Economics: September 13–15, 2023: Prague, Czech Republic, 2023
Další údaje
Jazyk
angličtina
Typ výsledku
Konferenční abstrakta
Stát vydavatele
Česká republika
Utajení
není předmětem státního či obchodního tajemství
Označené pro přenos do RIV
Ne
Organizace
Obchodně podnikatelská fakulta v Karviné – Slezská univerzita v Opavě – Repozitář
ISBN
978-80-11-04133-5
Klíčová slova anglicky
multi-criteria group decision-making; pairwise comparison matrices; consensual priority vector; coherence; Analytic Hierarchy Process (AHP)
Návaznosti
GA21-03085S, projekt VaV.
Změněno: 3. 4. 2024 04:19, Bc. Ivana Glabazňová
Anotace
V originále
The Analytic Hierarchy Process (AHP) is a method proposed to solve complex multi-criteria decision-making problems. Pairwise comparison methods are often used in AHP to derive the priorities of the successors of an element in the hierarchy. In this paper, we are concerned with group decision-making; that is, given n objects, such as criteria and/or variants, let m decision makers evaluate the n objects (pairwise) with respect to a criterion. The task is then to find a consensual priority vector of the m given n×n reciprocal pairwise comparison matrices. Recalling several desirable properties of the priority vector – consistency, intensity, and coherence – we consider the weakest one of the three, i.e. coherence, in the rest of the paper. In other words, given m coherent priority vectors, each provided by a decision maker of the group, the purpose is to find a single consensual priority vector of the group. To cope with this task, we propose a grade to measure the consensuality of a priority vector. We thus obtain an optimization problem, whose solution yields an optimal consensual ranking of the n given objects.