Algorithms to Detect and Rectify Multiplicative and Ordinal Inconsistencies of Fuzzy Preference Relations

Abstract

Consistency, multiplicative and ordinal, of fuzzy preference relations (FPRs) is investigated. The geometric consistency index (GCI) approximated thresholds are extended to measure the degree of consistency for an FPR. For inconsistent FPRs, two algorithms are devised: 1) to find the multiplicative inconsistent elements and 2) to detect the ordinally inconsistent elements. An integrated algorithm is proposed to improve simultaneously the ordinal and multiplicative consistencies. Finally, some examples, comparative analysis, and simulation experiments are provided to demonstrate the effectiveness of the proposed methods.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 69 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.