Assigning Entities to Teams as a Hypergraph Discovery Problem
<|reference_start|>Assigning Entities to Teams as a Hypergraph Discovery Problem: We propose a team assignment algorithm based on a hypergraph approach focusing on resilience and diffusion optimization. Specifically, our method is based on optimizing the algebraic connectivity of the Laplacian matrix of an edge-dependent vertex-weighted hypergraph. We used constrained simulated annealing, where we constrained the effort agents can exert to perform a task and the minimum effort a task requires to be completed. We evaluated our methods in terms of the number of unsuccessful patches to drive our solution into the feasible region and the cost of patching. We showed that our formulation provides more robust solutions than the original data and the greedy approach. We hope that our methods motivate further research in applying hypergraphs to similar problems in different research areas and in exploring variations of our methods.<|reference_end|>
@article{de arruda2024assigning,
    title={Assigning Entities to Teams as a Hypergraph Discovery Problem},
    author={Guilherme Ferraz de Arruda, Wan He, Nasimeh Heydaribeni, Tara Javidi,
  Yamir Moreno, Tina Eliassi-Rad},
    journal={arXiv preprint arXiv:2403.04063},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.04063},
    primaryClass={cs.SI math.SP physics.soc-ph}
}