Finds the pairwise comparisons with the maximum amount of inconsistency
After constructing a list of matrices with ε_{ij} = a_{ij}w_{j}/w_{i} (following ahp.error), this algorithm extracts the top n numbers of pairwise comparison matrices with the highest ε_{ij} for each decision-maker.
ahp.pwerror(ahpmat, atts, npw = 3)
ahpmat |
A list of pairwise comparison matrices of each decision maker generated by |
atts |
a list of attributes in the correct order |
npw |
Number of pairwise comparisons |
A list of matrices containing ε_{ij} = a_{ij}w_{j}/w_{i} for each decision-maker, with elements from the lower triangle set as NA automatically (since it is essentially equal to the element in the upper triangle).
Frankie Cho
Saaty TL (2004). “Decision making — the Analytic Hierarchy and Network Processes (AHP/ANP).” Journal of Systems Science and Systems Engineering, 13(1), 1–35. ISSN 1861-9576, doi: 10.1007/s11518-006-0151-5, https://doi.org/10.1007/s11518-006-0151-5.
library(magrittr)
atts <- c('cult', 'fam', 'house', 'jobs', 'trans')
data(city200)
cityahp <- ahp.mat(city200, atts, negconvert = TRUE)
ahp.error(cityahp, atts)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.