Group Role Assignment with Constraints (GRA+)
Haibin Zhu · 2021
Group Role Assignment (GRA) is a complex problem whose exhaustive search algorithm has exponential complexity. An efficient alternative algorithm to solve GRA problems was developed using the Hungarian algorithm (also called the Kuhn–Munkres algorithm) (Chapter 5). The general GRA problems have the constraints of a minimum number of agents required for each role and an assignment of only one role to each agent. After the GRA problem is solved, role assignment becomes a straightforward process if there are no additional constraints. However, there are many variations of GRA with additional constraints. GRA is an idealized role assignment scenario. In the real world, there are often many constraints when considering role assignment. We can classify these assignment problems as a new category of GRA, i.e. Group Role Assignment with Constraints, or simply, GRA + . This chapter discusses several important GRA + problems discovered, specified, and solved hitherto, i.e. Group Multi-Role Assignment (GMRA), Group Role Assignment with Conflicting Agents on Roles/in a Group (GRACAR/G), and Group Role Assignment with Cooperation and Conflict Factors (GRACCF).