z-logo
Premium
PAHAP: A Pairwise Aggregated Hierarchical Analysis of Ratio‐Scale Preferences
Author(s) -
Kang Moonsig,
Stam Antonie
Publication year - 1994
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1994.tb00823.x
Subject(s) - pairwise comparison , scale (ratio) , computer science , econometrics , statistics , operations research , mathematics , geography , cartography
In this paper, we present a Pairwise Aggregated Hierarchical Analysis of Ratio‐Scale Preferences (PAHAP), a new method for solving discrete alternative multicriteria decision problems. Following the Analytic Hierarchy Process (AHP), PAHAP uses pairwise preference judgments to assess the relative attractiveness of the alternatives. By first aggregating the pairwise judgment ratios of the alternatives across all criteria, and then synthesizing based on these aggregate measures, PAHAP determines overall ratio scale priorities and rankings of the alternatives which are not subject to rank reversal, provided that certain weak consistency requirements are satisfied. Hence, PAHAP can serve as a useful alternative to the original AHP if rank reversal is undesirable, for instance when the system is open and criterion scarcity does not affect the relative attractiveness of the alternatives. Moreover, the single matrix of pairwise aggregated ratings constructed in PAHAP provides useful insights into the decision maker's preference structure. PAHAP requires the same preference information as the original AHP (or, altematively, the same information as the Referenced AHP, if the criteria are compared based on average (total) value of the alternatives). As it is easier to implement and interpret than previously proposed variants of the conventional AHP which prevent rank reversal, PAHAP also appears attractive from a practitioner's viewpoint.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here