共 50 条
The consensus of probabilistic uncertain linguistic preference relations and the application on the virtual reality industry
被引:55
|作者:
Xie Wanying
[1
]
Ren Zhiliang
[1
]
Xu Zeshui
[1
,2
]
Wang Hai
[3
]
机构:
[1] Southeast Univ, Sch Econ & Management, Nanjing 211189, Jiangsu, Peoples R China
[2] Sichuan Univ, Sch Business, Chengdu 610064, Peoples R China
[3] Nanjing Audit Univ, Sch Govt Audit, Nanjing 211815, Jiangsu, Peoples R China
关键词:
Virtual reality;
Group decision-making;
Consensus;
Probabilistic uncertain linguistic preference relation;
Distance measure;
Similarity degree;
GROUP DECISION-MAKING;
SIMILARITY MEASURES;
FEEDBACK MECHANISM;
MODEL;
OPERATORS;
SETS;
TERMS;
D O I:
10.1016/j.knosys.2018.07.016
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
With the Pandora's Box of the virtual reality (VR) being opened, it is undoubtedly a good choice for those companies that have no VR experience and want a share in the competitive marketplace to cooperate with a leading VR company. How to choose an appropriate leading company becomes a group decision-making (GDM) problem that we want to deal with. Whereas volatile decision-making environment conduces that the decision-making information of the aforementioned GDM problem cannot be expressed by traditional explicit values. Thus, we choose probabilistic uncertain linguistic term set (HILTS) which is one of the most emerging decision making tools and relatively manifests the unstable decision-making information as an instrument to address the GDM problem. Then this paper studies the consensus among the preference relations (PRs) and selects a suitable alternative for the aforementioned GDM problem. Firstly, we construct the probabilistic uncertain linguistic preference relation (PULPR) and the normalized PULPR. Secondly, the distance measure and similarity degree are defined to measure the consensus degree. Moreover, the two specific consensus processes are described separately. One is based on the distance measure between the individual PULPR and the group PULPR, the other is based on the similarity degree among the individual PULPR. Thirdly, by using the selection process in the light of the proposed possibility degree, two corresponding algorithms are proposed for solving the practical GDM problem. Finally, a practical case of choosing applicable VR company is used to demonstrate the efficiency of the two algorithms.
引用
收藏
页码:14 / 28
页数:15
相关论文