Three-way conflict analysis and resolution based on interval set information

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-06-01 Epub Date: 2025-02-04 DOI:10.1016/j.ins.2025.121938
Sheng Gao , Hai-Long Yang , Zhi-Lian Guo
{"title":"Three-way conflict analysis and resolution based on interval set information","authors":"Sheng Gao ,&nbsp;Hai-Long Yang ,&nbsp;Zhi-Lian Guo","doi":"10.1016/j.ins.2025.121938","DOIUrl":null,"url":null,"abstract":"<div><div>In existing three-way conflict analysis (TWCA), once the ratings are given, the relationships between agents will be determined. However, agents may compromise to achieve a common goal when conflicts arise, which leads to variable ratings. This paper will present a novel TWCA model based on interval sets, where the ratings are represented by interval sets (the lower bound of an interval set represents the preferred rating, and the upper bound indicates the range of acceptable ratings). First, we give the notion of interval set conflict systems (ISCSs) and introduce a new conflict function. Second, considering the balance of agents' opinions, we assign issue weights according to the proportion of the absolute values of the column means of all agents' ratings (ACMR) across different issues. We then discuss the trisections of agent pairs, agent set, and issue set, where the thresholds are derived by the given conflict function. We propose two methods for conflict resolution by adjusting the preference ratings of some agents to form a maximal alliance among as many agents as possible. We verify the model's stability and validity through sensitivity analysis and comparative analysis. Finally, we apply this model to a case study of enterprise bidding.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"703 ","pages":"Article 121938"},"PeriodicalIF":6.8000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525000702","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/4 0:00:00","PubModel":"Epub","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In existing three-way conflict analysis (TWCA), once the ratings are given, the relationships between agents will be determined. However, agents may compromise to achieve a common goal when conflicts arise, which leads to variable ratings. This paper will present a novel TWCA model based on interval sets, where the ratings are represented by interval sets (the lower bound of an interval set represents the preferred rating, and the upper bound indicates the range of acceptable ratings). First, we give the notion of interval set conflict systems (ISCSs) and introduce a new conflict function. Second, considering the balance of agents' opinions, we assign issue weights according to the proportion of the absolute values of the column means of all agents' ratings (ACMR) across different issues. We then discuss the trisections of agent pairs, agent set, and issue set, where the thresholds are derived by the given conflict function. We propose two methods for conflict resolution by adjusting the preference ratings of some agents to form a maximal alliance among as many agents as possible. We verify the model's stability and validity through sensitivity analysis and comparative analysis. Finally, we apply this model to a case study of enterprise bidding.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于区间集信息的三向冲突分析与解决
在现有的三向冲突分析(TWCA)中,一旦给出了评级,就会确定代理之间的关系。然而,当冲突出现时,代理可能会妥协以实现共同的目标,从而导致不同的评级。本文将提出一种新的基于区间集的TWCA模型,其中评级用区间集表示(区间集的下界表示首选评级,上界表示可接受评级的范围)。首先,给出了区间集冲突系统的概念,并引入了一个新的冲突函数。其次,考虑到代理意见的平衡性,我们根据所有代理的评级(ACMR)的列均值绝对值在不同问题上的比例分配问题权重。然后讨论代理对、代理集和问题集的三切分,其中的阈值由给定的冲突函数派生。我们提出了两种解决冲突的方法,通过调整一些代理的偏好等级来形成尽可能多的代理之间的最大联盟。通过敏感性分析和对比分析验证了模型的稳定性和有效性。最后,将该模型应用于企业招投标案例研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Verification and enforcement of k-step mutual opacity of networked systems A structure-aware multi-subspace granular-ball clustering framework ReForm-Net: Label reconstruction for high-precision detection of irregular steel surface defects AiGAS-dEVL: An adaptive incremental neural gas model for drifting data streams under extreme verification latency A post-quantum hierarchical and adaptive LWE-based secret image sharing scheme with verifiable reconstruction
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1