Interval fuzzy preference relations can be useful to express decision makers' preferences in group decision-making problems. Usually, we apply a selection process and a consensus process to solve a group decision situation. In this paper, we present a consensus model for group decisionmaking problems with interval fuzzy preference relations. This model is based on two consensus criteria, a cons...

Weighted aggregation of fuzzy preference relations on the set of alternatives by several criteria in decision-making problems is considered. Pairwise comparisons with respect to importance of the criteria are given in fuzzy preference relation as well. The aggregation procedure uses the composition between each two relations of the alternatives. The membership function of the newly constructed ...

In [14] Yager and Filev introduced the Induced Ordered Weighted Averaging (IOWA) operator. In this paper, we provide some IOWA operators to aggregate fuzzy preference relations in group decision making problems. In particular, we present the Importance IOWA (I-IOWA) operator, the Consistency IOWA (C-IOWA) operator and the Preference IOWA (P-IOWA) operator. We also provide a procedure to deal wi...

We present a consensus model for group decision making with unbalanced fuzzy linguistic preference relations, i.e., assuming that the preferences are assessed on linguistic term sets whose terms are not symmetrically and uniformly distributed. This consensus model can manage incomplete information situations, that is, situations where the experts do not give all the preference values that they ...

This paper investigates the problem of preference modeling under the belief function framework. In this work, we introduce a new model that is able to generate quantitative information from qualitative assessments. Therefore, we suggest to represent the decision maker preferences in different levels where the indifference, strict preference, weak preference and incompleteness relations are cons...

We develop a general concept of majority rule for finitely many choice alternatives that is consistent with arbitrary binary preference relations, real-valued utility functions, probability distributions over binary preference relations, and random utility representations. The underlying framework is applicable to virtually any type of choice, rating, or ranking data, not just the linear orders...

Social commerce based on relations is developing rapidly in recent years and the personalized recommender systems make the contribution. Based on the traditional collaborative filtering (CF) algorithm, this study proposes a social recommender systems that combing preference similarity, reputation-based trust and social relations between users. Using the real data from Epinions.com, we compared ...

Consistency has always been a hot topic in the study of decision-making based on preference relations. This paper focuses consistency hesitant fuzzy linguistic relations (HFLPRs). Firstly, new definition additive HFLPRs is given. Secondly, to examine whether an HFLPR additively consistent, two equivalent programming models are constructed. Thirdly, for inconsistent HFLPRs, corresponding improve...

As usually considered in Social Choice theory, the problem of preference aggregation is to find a natural and fair “merge” operation (subject to various naturalness or fairness conditions), for aggregating the agents’ preferences into a single group preference. Depending on the stringency of the required fairness conditions, one can obtain either an Impossibility theorem (e.g Arrows theorem [2]...