Incomplete Hesitant Fuzzy Preference Relations in Group Decision Making

In this article, incomplete hesitant fuzzy preference relations are under consideration. In order to estimate expressible missing preferences, a hesitant upper bound condition (hubc) is defined for decision makers presenting incomplete information. With the help of this condition, the estimated preference intensities lie inside the defined domain and thus are expressible. An algorithm is proposed to revise minimal possible preferences so that the resultant satisfies property (hubc). Moreover, ranking rule, HF-Borda count, for hesitant fuzzy preference relations is defined. This method dissolves possible ties among alternatives.