Evaluating scales for pairwise comparisons
نویسندگان
چکیده
Abstract Pairwise comparisons have been a long-standing technique for comparing alternatives/criteria and their role has pivotal in the development of modern decision-making methods. The evaluation is very often done linguistically. Several scales proposed to translate linguistic into quantitative evaluation. In this paper, we perform an experiment investigate, under our methodological choices, which type scale provides best matching decision-maker’s verbal representation. aims evaluate suitability eight problems different sizes. We find that inverse linear representation whenever objective data are measured by means pairwise matrices suitable distance between applied computing error.
منابع مشابه
Pairwise Comparisons Simplified
This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from n · (n − 1) to n − 1. An algorithm of reconstructing of the PC matrix from its set of generators is presented.
متن کاملOn the Evaluation and Application of Different Scales For Quantifying Pairwise Comparisons in Fuzzy Sets
One of the most critical issues in many applications of fuzzy sets is the successful evaluation of membership values. A method based on pairwise comparisons provides an interesting way for evaluating membership values. That method was proposed by Saaty, almost 20 years ago, and since then it has captured the interest of many researchers around the world. However, recent investigations reveal th...
متن کاملAxiomatization of inconsistency indicators for pairwise comparisons
This study proposes axioms for inconsistency indicators in pairwise comparisons. The new observation (by Szybowski), that “no PC submatrix may have a worse inconsistency indicator than the given PC matrix” is an essential simplification of the axiomatization. The goal of formulating axioms for all future definitions of new inconsistency indicators is difficult and as illusive as the inconsisten...
متن کاملActive Ranking using Pairwise Comparisons
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log2 n pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, w...
متن کاملEfficient Ranking from Pairwise Comparisons
The ranking of n objects based on pairwise comparisons is a core machine learning problem, arising in recommender systems, ad placement, player ranking, biological applications and others. In many practical situations the true pairwise comparisons cannot be actively measured, but a subset of all n(n−1)/2 comparisons is passively and noisily observed. Optimization algorithms (e.g., the SVM) coul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2022
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-022-04682-8