Avoiding Conflicts by Group Role Assignment

摘要

Role assignment is a critical element in the role-based collaboration process. There are many constraints to be considered when undertaking this task. This paper formalizes the group role assignment problem when faced with the constraint of conflicting agents, verifies the benefits of solving the problem, proves that such a problem is a subproblem of the extended integer linear programming (x-ILP) problem, proposes a practical approach to the solution, and assures performance based on the results of experiments. The contributions of this paper include: 1) formalization of the proposed problem; 2) verification of the benefit achieved by avoiding conflicts in role assignment through simulation; 3) theoretical proof that conflict avoidance is a subproblem of the x-ILP problem that is nonpolynomial-complete; and 4) a practical solution based on the IBM ILOG CPLEX optimization package (ILOG) and verification of the scale of problems that can be solved with ILOG. The proposed approach is validated by simulation experiments. Its efficiency is verified by comparison with the previous exhaustive search-based approach.