Iterative Role Negotiation via the Bilevel GRA++ With Decision Tolerance

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Qian Jiang;Dongning Liu;Haibin Zhu;Shijue Wu;Naiqi Wu;Xin Luo;Yan Qiao
{"title":"Iterative Role Negotiation via the Bilevel GRA++ With Decision Tolerance","authors":"Qian Jiang;Dongning Liu;Haibin Zhu;Shijue Wu;Naiqi Wu;Xin Luo;Yan Qiao","doi":"10.1109/TCSS.2024.3409893","DOIUrl":null,"url":null,"abstract":"Role negotiation (RN) is situated at the initial stage of the role-based collaboration (RBC) methodology and is independent of the subsequent agent evaluation and role assignment (RA) processes. RN is to determine the roles and the resource requirements for each role. In existing RBC-related research, RN is assumed to be static. This means that the roles and the resource requirements for each role are predetermined by decision-makers. However, the resources allocated to each role can vary. At this time, iterative RN outcomes will have different RA results. There may not be a direct dominant relationship between different RA outcomes, especially when solving group role assignment (GRA) with multiple objectives (GRA++) problems, which makes it even more complex. To address these concerns, we introduce the original bilevel GRA++ (BGRA++) model. Specifically, at the lower level of BGRA++, a strategy is designed for quantifying iterative RNs. For the upper level, we introduce the novel GRA-NSGA-II algorithm for the RA process. Finally, we introduce the concept of decision tolerance to assist decision-makers in selecting the optimal solution from the multiple RNs. Last, simulation experiments are conducted to verify the robustness and practicability of the proposed method. Comparisons and discussions show that the proposed solution is highly competitive for solving the GRA++ problem with iterative RN.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"11 6","pages":"7484-7499"},"PeriodicalIF":4.5000,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10574173/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Role negotiation (RN) is situated at the initial stage of the role-based collaboration (RBC) methodology and is independent of the subsequent agent evaluation and role assignment (RA) processes. RN is to determine the roles and the resource requirements for each role. In existing RBC-related research, RN is assumed to be static. This means that the roles and the resource requirements for each role are predetermined by decision-makers. However, the resources allocated to each role can vary. At this time, iterative RN outcomes will have different RA results. There may not be a direct dominant relationship between different RA outcomes, especially when solving group role assignment (GRA) with multiple objectives (GRA++) problems, which makes it even more complex. To address these concerns, we introduce the original bilevel GRA++ (BGRA++) model. Specifically, at the lower level of BGRA++, a strategy is designed for quantifying iterative RNs. For the upper level, we introduce the novel GRA-NSGA-II algorithm for the RA process. Finally, we introduce the concept of decision tolerance to assist decision-makers in selecting the optimal solution from the multiple RNs. Last, simulation experiments are conducted to verify the robustness and practicability of the proposed method. Comparisons and discussions show that the proposed solution is highly competitive for solving the GRA++ problem with iterative RN.
基于决策容忍的双层gra++迭代角色协商
角色协商(RN)位于基于角色的协作(RBC)方法的初始阶段,独立于后续的代理评估和角色分配(RA)过程。RN用于确定角色和每个角色的资源需求。在现有的与红细胞相关的研究中,假设RN是静态的。这意味着角色和每个角色的资源需求是由决策者预先确定的。但是,分配给每个角色的资源可能会有所不同。此时,迭代的RN结果会有不同的RA结果。不同的RA结果之间可能没有直接的主导关系,特别是在解决多目标群体角色分配(GRA) (gra++)问题时,这使得它更加复杂。为了解决这些问题,我们引入了最初的双层gra++ (bgra++)模型。具体而言,在bgra++的底层,设计了一种量化迭代RNs的策略。在上层,我们引入了新的RA- nsga - ii算法。最后,我们引入了决策容忍的概念,以帮助决策者从多个rn中选择最优解。最后,通过仿真实验验证了该方法的鲁棒性和实用性。比较和讨论表明,本文提出的解决方案对于用迭代RN解决gra++问题具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信