4.7 Article

Group consensus algorithms based on preference relations

期刊

INFORMATION SCIENCES
卷 181, 期 1, 页码 150-162

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2010.08.002

关键词

Group decision making; Fuzzy preference relation; Multiplicative preference relation; Goal programming model; Quadratic programming; Iterative algorithm

资金

  1. National Science Fund for Distinguished Young Scholars of China [70625005]
  2. National Natural Science Foundation of China [71071161, 70932005]
  3. Research Grants Council of Hong Kong [410208]

向作者/读者索取更多资源

In many group decision-making situations, decision makers' preferences for alternatives are expressed in preference relations (including fuzzy preference relations and multiplicative preference relations). An important step in the process of aggregating preference relations, is to determine the importance weight of each preference relation. In this paper, we develop a number of goal programming models and quadratic programming models based on the idea of maximizing group consensus. Our models can be used to derive the importance weights of fuzzy preference relations and multiplicative preference relations. We further develop iterative algorithms for reaching acceptable levels of consensus in group decision making based on fuzzy preference relations or multiplicative preference relations. Finally, we include an illustrative example. (C) 2010 Published by Elsevier Inc.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据