Assigning agents to teams under strict task and effort constraints is crucial in business, science, and engineering, where disruptions can cause significant losses. Current methods do not explore hypergraph-based solutions that explicitly optimize algebraic connectivity under constraints, leaving unresolved how to systematically form robust, recoverable teams. We present a hypergraph-based team assignment algorithm where nodes represent agents and hyperedges represent tasks. The search is guided by input constraints and aims to optimize resilience and diffusion by maximizing the algebraic connectivity of an edge-dependent, vertex-weighted hypergraph. We employ constrained simulated annealing to find a satisfactory hypergraph by enforcing both the minimum effort required for task completion and the maximum effort agents can exert. We evaluate robustness by assessing solution recovery after node removal attacks. Our results demonstrate that the hypergraph formulation yields more robust solutions than the bipartite formulation and the greedy approach.
NetSI authors
