Game-theoretic multi-granularity consensus adjustment for social network group decision-making

IF 2.8 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hanzhong Hou , Chao Zhang , Deyu Li , Wentao Li
{"title":"Game-theoretic multi-granularity consensus adjustment for social network group decision-making","authors":"Hanzhong Hou ,&nbsp;Chao Zhang ,&nbsp;Deyu Li ,&nbsp;Wentao Li","doi":"10.1016/j.ijar.2025.109610","DOIUrl":null,"url":null,"abstract":"<div><div>The continuous trend development of information intelligence has made social network group decision-making (SN-GDM) increasingly important. However, in the context of SN-GDM, there are three key challenges: how to properly handle the decline in the trust propagation efficiency; the single granularity consensus adjustment strategy may not fully consider the impact of groups with high consensus on costs and the different cooperation intention of subgroups; traditional methods often face challenges in determining high-performance classification thresholds. In response to the above issues, the solution involves reconstructing trust relationships and optimizing clustering via the Leiden algorithm (LA) and structural holes (SHs). Moreover, multi-granularity consensus adjustment is implemented using game theory while classification thresholds are refined with game-theoretic rough sets (GTRSs). More specifically, firstly, the discount rate of trust propagation intermediaries and path reliability are considered to conduct indirect trust propagation and multipath fusion, and the cooperation index (CI) is obtained based on trust relationships and similarities. Secondly, LA is used to cluster DMs, with the CI as the edge weight, to ensure that the community reflects social relationships and opinion consensus. The weight of decision-makers (DMs) and subgroups are objectively determined by comprehensively integrating SHs, CI, similarity and in-degree centrality. Thirdly, a multi-granularity consensus adjustment method involving game theory is proposed. This method considers three adjustment scenarios: joint adjustment, cooperative game, and non-cooperative game, to obtain the optimal adjustment strategy while ensuring the individual benefit of participants. Then, the generality and accuracy of classification thresholds are improved via the application of GTRSs. Finally, a case study is conducted on the evaluation of scenic spots via a questionnaire survey, verifying the feasibility and effectiveness of the proposed method.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"190 ","pages":"Article 109610"},"PeriodicalIF":2.8000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X25002518","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/12/8 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The continuous trend development of information intelligence has made social network group decision-making (SN-GDM) increasingly important. However, in the context of SN-GDM, there are three key challenges: how to properly handle the decline in the trust propagation efficiency; the single granularity consensus adjustment strategy may not fully consider the impact of groups with high consensus on costs and the different cooperation intention of subgroups; traditional methods often face challenges in determining high-performance classification thresholds. In response to the above issues, the solution involves reconstructing trust relationships and optimizing clustering via the Leiden algorithm (LA) and structural holes (SHs). Moreover, multi-granularity consensus adjustment is implemented using game theory while classification thresholds are refined with game-theoretic rough sets (GTRSs). More specifically, firstly, the discount rate of trust propagation intermediaries and path reliability are considered to conduct indirect trust propagation and multipath fusion, and the cooperation index (CI) is obtained based on trust relationships and similarities. Secondly, LA is used to cluster DMs, with the CI as the edge weight, to ensure that the community reflects social relationships and opinion consensus. The weight of decision-makers (DMs) and subgroups are objectively determined by comprehensively integrating SHs, CI, similarity and in-degree centrality. Thirdly, a multi-granularity consensus adjustment method involving game theory is proposed. This method considers three adjustment scenarios: joint adjustment, cooperative game, and non-cooperative game, to obtain the optimal adjustment strategy while ensuring the individual benefit of participants. Then, the generality and accuracy of classification thresholds are improved via the application of GTRSs. Finally, a case study is conducted on the evaluation of scenic spots via a questionnaire survey, verifying the feasibility and effectiveness of the proposed method.
社会网络群体决策的博弈论多粒度共识调整
随着信息智能化趋势的不断发展,社会网络群体决策(social network group decision, SN-GDM)变得越来越重要。然而,在SN-GDM的背景下,有三个关键的挑战:如何妥善处理信任传播效率的下降;单粒度共识调整策略可能没有充分考虑高共识群体对成本的影响以及子群体不同的合作意向;传统方法在确定高性能分类阈值方面经常面临挑战。针对上述问题,通过Leiden算法(LA)和结构洞(SHs)进行信任关系重构和聚类优化。利用博弈论实现多粒度共识调整,利用博弈论粗糙集(GTRSs)细化分类阈值。具体而言,首先考虑信任传播中介的贴现率和路径可靠性,进行间接信任传播和多路径融合,并基于信任关系和相似度得到合作指数(CI);其次,采用LA对dm进行聚类,以CI作为边缘权重,确保社区反映社会关系和意见共识;通过综合综合SHs、CI、相似度和度中心性,客观确定决策者和子群体的权重。第三,提出了一种涉及博弈论的多粒度共识调整方法。该方法考虑联合调整、合作博弈和非合作博弈三种调整情景,在保证参与者个体利益的前提下,获得最优的调整策略。然后,通过gtrs的应用,提高分类阈值的通用性和准确性。最后,通过问卷调查对景区进行评价,验证了所提方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning 工程技术-计算机:人工智能
CiteScore
6.90
自引率
12.80%
发文量
170
审稿时长
67 days
期刊介绍: The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest. Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning. Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书