Koczkodaj, W. W. A new definition of consistency of pairwise comparisons. (English) Zbl 0804.92029 Math. Comput. Modelling 18, No. 7, 79-84 (1993). Summary: A new definition of consistency is introduced. It allows us to locate the roots of inconsistency and is easy to interpret. It also forms a better basis than the old eigenvalue consistency for selecting a threshold based on common sense. The new definition of consistency is applicable to expert systems and to knowledge acquisition. It is instrumental in applications of fuzzy sets and the theory of evidence where the definitions of the membership and belief functions are fundamental issues. Cited in 2 ReviewsCited in 64 Documents MSC: 91C99 Social and behavioral sciences: general topics 62J15 Paired and multiple comparisons; multiple testing Keywords:pairwise comparisons; new definition of consistency; expert systems; knowledge acquisition; applications of fuzzy sets; membership; belief functions Software:Concluder PDFBibTeX XMLCite \textit{W. W. Koczkodaj}, Math. Comput. Modelling 18, No. 7, 79--84 (1993; Zbl 0804.92029) Full Text: DOI References: [1] Thurstone, L. L., A law of comparative judgements, Psychological Review, 34, 273-286 (1927) [2] Hwang, C.-L.; Yoon, K., Multiple Attribute Decision Making (1981), Springer-Verlag: Springer-Verlag Berlin [3] Nijkamp, Multicriteria Evaluation in Physical Planning (1991), Springer-Verlag: Springer-Verlag Berlin [4] Saaty, T. L., A scaling methods for priorities in hierarchical structure, Journal of Mathematical Psychology, 15, 234-281 (1977) · Zbl 0372.62084 [5] Davis, H. A., The Method of Pairwise Comparisons (1963), Griffin: Griffin London This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.