Abstract
As we may have a set of possible values when comparing alternatives (or criteria), the hesitant fuzzy preference relation becomes a suitable and powerful technique to deal with this case. This paper mainly focuses on the multiplicative consistency of the hesitant fuzzy preference relation. First of all, we explore some properties of the hesitant fuzzy preference relation and develop some new aggregation operators. Then we introduce the concepts of multiplicative consistency, perfect multiplicative consistency and acceptable multiplicative consistency for a hesitant fuzzy preference relation, based on which, two algorithms are given to improve the inconsistency level of a hesitant fuzzy preference relation. Furthermore, the consensus of group decision making is studied based on the hesitant fuzzy preference relations. Finally, several illustrative examples are given to demonstrate the practicality of our algorithms.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Information Technology & Decision Making
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.
