Czech digital mathematics library · 2003 · 26 citations · 9 references
Open access
ComputingComputer ScienceAlgorithmsInformation RetrievalOptimizationApproximation AlgorithmsCriteria WeightingPreference ElicitationRanking ProblemsSearch SystemsConsistencyDistance-based RankingGoal Programming AlgorithmsPairwise ComparisonPairwise Comparison ModelsPairwise Preference ModelingPairwise RankingRanking Algorithms
summary:The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within a distance-based framework. In this context, Goal Programming is introduced as a flexible tool for computing priority weights.
9
Handbook of critical issues in goal programming
H. Pastijn · European Journal of Operational Research · 1992 · 498 citations
Further Contributions to the Theory of Paired Comparisons
M. G. Kendall · Biometrics · 1955 · 331 citations