Abstract

In social network group decision making (SN-GDM) problem, subgroup weights are mostly unknown, many approaches have been proposed to determine the subgroup weights. However, most of these methods ignore the weight manipulation behavior of subgroups. Some studies indicated that weight manipulation behavior hinders consensus efficiency. To deal with this issue, this paper proposes a theoretical framework to prevent weight manipulation in SN-GDM. Firstly, a community detection based method is used to cluster the large group. The power relations of subgroups are measured by the power index (PI), which depends on the subgroups size and cohesion. Then, a minimum adjustment feedback model with maximum entropy is proposed to prevent subgroups' manipulation behavior. The minimum adjustment rule aims for 'efficiency' while the maximum entropy rule aims for 'justice'. The experimental results show that the proposed model can guarantee the rationality of weight distribution to reach consensus efficiently, which is achieved by maintaining a balance between 'efficiency' and 'justice' in the mechanism of assigning weights. Finally, the detailed numerical and simulation analyses are carried out to verify the validity of the proposed method.

Full Text
Paper version not known

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 call

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.