An algorithm for generating consistent and transitive approximations of reciprocal preference relations

Authors:
Steven Freson;Hans De Meyer;Bernard De Baets
Affiliations:
Department of Applied Mathematics and Computer Science, Ghent University, Gent, Belgium;Department of Applied Mathematics and Computer Science, Ghent University, Gent, Belgium;Department of Applied Mathematics, Biometrics and Process Control, Ghent University, Gent, Belgium
Venue:
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Year:
2010

Citing 10
Cited 1

Strong transitivity, rationality and weak monotonicity in fuzzy pairwise comparisons

Fuzzy Sets and Systems
General transitivity conditions for fuzzy reciprocal preference matrices

Fuzzy Sets and Systems - Special issue: Preference modelling and applications
The complete linkage clustering algorithm revisited

Soft Computing - A Fusion of Foundations, Methodologies and Applications
A consistency-based procedure to estimate missing pairwise preference values

International Journal of Intelligent Systems
Cardinal consistency of reciprocal preference relations: a characterization of multiplicative transitivity

IEEE Transactions on Fuzzy Systems
A method for repairing the inconsistency of fuzzy preference relations

Fuzzy Sets and Systems
Transitivity frameworks for reciprocal relations: cycle-transitivity versus FG-transitivity

Fuzzy Sets and Systems
On the cycle-transitivity of the mutual rank probability relation of a poset

Fuzzy Sets and Systems
Algorithms for the computation of T-transitive closures

IEEE Transactions on Fuzzy Systems
Transitivity Bounds in Additive Fuzzy Preference Structures

IEEE Transactions on Fuzzy Systems

A framework for multiset merging

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We establish an iterative algorithm to generate for any given reciprocal relation and any given type of transitivity fitting into the framework of cycle-transitivity, a unique reciprocal relation that approximates the given reciprocal relation and possesses the given transitivity property. In the context of decision making, the algorithm can be used to generate a consistent approximation of a non-consistent reciprocal preference relation.