Satisfactory of the condition of order preservation, a simulation study
From MaRDI portal
Publication:5142146
Abstract: We examine satisfaction of the condition of order preservation (COP) with respect to different levels of inconsistency for randomly generated multiplicative pairwise comparison matrices (MPCMs) of the order n = {3,4,...,9}, where a priority vector is derived both by the eigenvalue method (EV) and the geometric mean (GM) method. Our results suggest the GM method and the EV method preserve the COP condition almost identically, both for the less inconsistent matrices (with Saaty's consistency index CI <0.10), and the more inconsistent matrices (with CI >= 0.10). Further, we find that the frequency of the COP violations grows (almost linearly) with increasing inconsistency of MPCMs measured by Koczkodaj's inconsistency index and Saaty's consistency index respectively, and we provide graphs to illustrate these relationships for MPCMs of the order n ={4, 7, 9}.
Recommendations
- Notes on order preservation and consistency in AHP
- Some new properties of inconsistent pairwise comparisons matrices
- Inconsistency and rank preservation
- On Saaty's and Koczkodaj's inconsistencies of pairwise comparison matrices
- Preservation of preferences intensity of an inconsistent pairwise comparison matrix
Cited in
(5)- Some new properties of inconsistent pairwise comparisons matrices
- When is the condition of order preservation met?
- Notes on order preservation and consistency in AHP
- New preference violation indices for the condition of order preservation
- On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels
This page was built for publication: Satisfactory of the condition of order preservation, a simulation study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142146)