Name
Abstract | ||
|---|---|---|
This study presents theoretical proof and empirical evidence of the reduction algorithm convergence for the distance-based inconsistency in pairwise comparisons. Our empirical research shows that the convergence very quick. It usually takes less than 10 reductions to bring the inconsistency of the pairwise comparisons matrix below the assumed threshold of 1/3 sufficient for most applications. We believe that this is the first Monte Carlo study demonstrating such results for the convergence speed of inconsistency reduction in pairwise comparisons. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.3233/FI-2015-1184 | Fundam. Inform. |
Keywords | Field | DocType |
pairwise comparisons,distance-based inconsistency,convergence,knowledge management | Convergence (routing),Applied mathematics,Discrete mathematics,Pairwise comparison,Monte Carlo method,Mathematical optimization,Empirical evidence,Matrix (mathematics),Algorithm convergence,Mathematics,Empirical research | Journal |
Volume | Issue | ISSN |
137 | 3 | 0169-2968 |
Citations | PageRank | References |
7 | 0.71 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Waldemar W. Koczkodaj | 1 | 628 | 100.50 |
| Marek Kosiek | 2 | 7 | 0.71 |
| J. Szybowski | 3 | 43 | 8.45 |
| Ding Xu | 4 | 7 | 0.71 |