Abstract

The analytic hierarchy process is a widely used multi-criteria decision-making method that involves the construction of pairwise comparison matrices. To infer a decision, a consistent or near-consistent matrix is desired, and therefore, several methods have been developed to control or improve the overall consistency of the matrix. However, controlling the overall consistency does not necessarily prevent having strong local inconsistencies. Local inconsistencies are local distortions which can lead to rank reversal when a new alternative is added or deleted. To address this problem, we propose an algorithm for controlling the inconsistency during the construction of the pairwise comparison matrix. The proposed algorithm assists decision makers whilst entering their judgments and does not allow strong local inconsistencies. This algorithm is based on the transitivity rule and has been verified through statistical simulations. Appropriate thresholds of acceptable evaluations have been inferred from these simulations. We demonstrate that the proposed algorithm is a helpful decision aid to decision makers when entering pairwise comparison judgments.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.