Feng Wang , Xiaobing Yu , Yaqi Mao , Witold Pedrycz
{"title":"基于议价博弈的最小成本和最大满意度共识的社会网络群体决策","authors":"Feng Wang , Xiaobing Yu , Yaqi Mao , Witold Pedrycz","doi":"10.1016/j.inffus.2025.103270","DOIUrl":null,"url":null,"abstract":"<div><div>In group decision making (GDM), different decision makers (DMs) will provide different evaluation opinions for alternatives. Consensus-reaching process on these opinions is a critical issue. To improve consensus efficiency, a dynamic social network GDM method based on a bargaining game is developed. First, we build a minimum total cost consensus model for the moderator and then a maximum individual satisfaction consensus model for inconsistent DMs. For the difference in the modified opinions and unit compensation derived from these two types of models, we devise offer-counteroffer strategies for the moderator and DMs under various cases. At the same time, we establish a complete management system for the DM weights based on different behaviors in consensus promotion. In addition, we formulate the trust evolution process of all types of DMs to further update the weights of DMs. Based on this, a consensus feedback iterative mechanism driven by the trust network is constructed. Finally, we use the example of location of an international R&D center to illustrate the entire GDM process. The comparative analysis demonstrates the effectiveness of the proposed method.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"123 ","pages":"Article 103270"},"PeriodicalIF":14.7000,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Social network group decision making with minimum cost and maximum satisfaction consensus based on bargaining game\",\"authors\":\"Feng Wang , Xiaobing Yu , Yaqi Mao , Witold Pedrycz\",\"doi\":\"10.1016/j.inffus.2025.103270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In group decision making (GDM), different decision makers (DMs) will provide different evaluation opinions for alternatives. Consensus-reaching process on these opinions is a critical issue. To improve consensus efficiency, a dynamic social network GDM method based on a bargaining game is developed. First, we build a minimum total cost consensus model for the moderator and then a maximum individual satisfaction consensus model for inconsistent DMs. For the difference in the modified opinions and unit compensation derived from these two types of models, we devise offer-counteroffer strategies for the moderator and DMs under various cases. At the same time, we establish a complete management system for the DM weights based on different behaviors in consensus promotion. In addition, we formulate the trust evolution process of all types of DMs to further update the weights of DMs. Based on this, a consensus feedback iterative mechanism driven by the trust network is constructed. Finally, we use the example of location of an international R&D center to illustrate the entire GDM process. The comparative analysis demonstrates the effectiveness of the proposed method.</div></div>\",\"PeriodicalId\":50367,\"journal\":{\"name\":\"Information Fusion\",\"volume\":\"123 \",\"pages\":\"Article 103270\"},\"PeriodicalIF\":14.7000,\"publicationDate\":\"2025-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Fusion\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1566253525003434\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Fusion","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1566253525003434","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Social network group decision making with minimum cost and maximum satisfaction consensus based on bargaining game
In group decision making (GDM), different decision makers (DMs) will provide different evaluation opinions for alternatives. Consensus-reaching process on these opinions is a critical issue. To improve consensus efficiency, a dynamic social network GDM method based on a bargaining game is developed. First, we build a minimum total cost consensus model for the moderator and then a maximum individual satisfaction consensus model for inconsistent DMs. For the difference in the modified opinions and unit compensation derived from these two types of models, we devise offer-counteroffer strategies for the moderator and DMs under various cases. At the same time, we establish a complete management system for the DM weights based on different behaviors in consensus promotion. In addition, we formulate the trust evolution process of all types of DMs to further update the weights of DMs. Based on this, a consensus feedback iterative mechanism driven by the trust network is constructed. Finally, we use the example of location of an international R&D center to illustrate the entire GDM process. The comparative analysis demonstrates the effectiveness of the proposed method.
期刊介绍:
Information Fusion serves as a central platform for showcasing advancements in multi-sensor, multi-source, multi-process information fusion, fostering collaboration among diverse disciplines driving its progress. It is the leading outlet for sharing research and development in this field, focusing on architectures, algorithms, and applications. Papers dealing with fundamental theoretical analyses as well as those demonstrating their application to real-world problems will be welcome.