A gradient method for inconsistency reduction of pairwise comparisons matrices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F22%3AA0000289" target="_blank" >RIV/47813059:19520/22:A0000289 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0888613X22001645?dgcid=rss_sd_all" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0888613X22001645?dgcid=rss_sd_all</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A gradient method for inconsistency reduction of pairwise comparisons matrices
Original language description
We investigate an application of a mathematically robust minimization method - the gradient method - to the consistencization problem of pairwise comparisons (PC) matrix. Our approach sheds new light on the notion of a priority vector and leads naturally to the definition of instant priority vectors. We describe a sample family of inconsistency indicators based on various ways of taking an average value, which extends the inconsistency indicator based on the “sup”- norm. We apply this family of inconsistency indicators both for additive and multiplicative PC matrices to show that the choice of various inconsistency indicators leads to non-equivalent consistencization procedures.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA21-03085S" target="_blank" >GA21-03085S: Supporting Decision Processes with Pairwise Comparisons and Data Mining</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Approximate Reasoning
ISSN
0888-613X
e-ISSN
—
Volume of the periodical
Neuveden
Issue of the periodical within the volume
152
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
46-58
UT code for WoS article
000877684300003
EID of the result in the Scopus database
—