Fine-Grained Group Role Assignment Based on Time-Oriented Cooperation and Conflict

Group role allocation considering cooperation and conflict factors (GRACCF) is a creative social computing method for team-building. Maximize the performance of the new team by role allocation, taking into account the cooperation and conflict factors among agents. However, in complex process-oriented projects composed of multiple sub-project stages, the job requirements of each sub-project stage will change over time. This new scenario leads to two changes in role allocation: 1. The conflict or cooperation relationships among candidates that affect team efficiency change from static relationships to dynamic relationships. 2. The role allocation shifts from a coarse-grained assignment mode, where roles cover the entire project, to a Fine-grained mode that links roles with specific sub-project stages. Therefore, in order to solve the role allocation problem at this time, this paper improves GRACCF and proposes a fine-grained group role allocation method considering cooperation and conflict based on time (GRACCF-T). Meanwhile, GRACCF discovers potential CCFs through logical reasoning by KD-45 closure calculation, but the obtained CCFs are not comprehensive enough. Therefore, GRACCF-T adopts the collaborative filtering method for discovering, enhancing the comprehensiveness of the obtained potential CCFs. Finally, we use the IBM ILOG CPLEX optimization suite to solve GRACCF-T and verify the feasibility and effectiveness of this method through simulation experiments.

Authors

Institutions

Publication Details

Published
2025-05-05
DOI
https://doi.org/10.1109/cscwd64889.2025.11033475
Primary Topic
Evolutionary Game Theory and Cooperation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fine-Grained Group Role Assignment Based on Time-Oriented Cooperation and Conflict

Hao Jan Liu, Lu Liang
Evolutionary Game Theory and Cooperation
article

Fine-Grained Group Role Assignment Based on Time-Oriented Cooperation and Conflict

Hao Jan Liu, Lu Liang
article en

Abstract

Group role allocation considering cooperation and conflict factors (GRACCF) is a creative social computing method for team-building. Maximize the performance of the new team by role allocation, taking into account the cooperation and conflict factors among agents. However, in complex process-oriented projects composed of multiple sub-project stages, the job requirements of each sub-project stage will change over time. This new scenario leads to two changes in role allocation: 1. The conflict or cooperation relationships among candidates that affect team efficiency change from static relationships to dynamic relationships. 2. The role allocation shifts from a coarse-grained assignment mode, where roles cover the entire project, to a Fine-grained mode that links roles with specific sub-project stages. Therefore, in order to solve the role allocation problem at this time, this paper improves GRACCF and proposes a fine-grained group role allocation method considering cooperation and conflict based on time (GRACCF-T). Meanwhile, GRACCF discovers potential CCFs through logical reasoning by KD-45 closure calculation, but the obtained CCFs are not comprehensive enough. Therefore, GRACCF-T adopts the collaborative filtering method for discovering, enhancing the comprehensiveness of the obtained potential CCFs. Finally, we use the IBM ILOG CPLEX optimization suite to solve GRACCF-T and verify the feasibility and effectiveness of this method through simulation experiments.

Guangdong University of Technology (CN)
Openalex Percentile: Top 81%
Evolutionary Game Theory and Cooperation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.