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.
Full Text
Published Version
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