Assigning Entities to Teams as a Hypergraph Discovery Problem
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913257558638592 |
|---|---|
| author | de Arruda, Guilherme Ferraz He, Wan Heydaribeni, Nasimeh Javidi, Tara Moreno, Yamir Eliassi-Rad, Tina |
| author_facet | de Arruda, Guilherme Ferraz He, Wan Heydaribeni, Nasimeh Javidi, Tara Moreno, Yamir Eliassi-Rad, Tina |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_04063 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Assigning Entities to Teams as a Hypergraph Discovery Problem de Arruda, Guilherme Ferraz He, Wan Heydaribeni, Nasimeh Javidi, Tara Moreno, Yamir Eliassi-Rad, Tina Social and Information Networks Spectral Theory Physics and Society 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. |
| title | Assigning Entities to Teams as a Hypergraph Discovery Problem |
| topic | Social and Information Networks Spectral Theory Physics and Society |
| url | https://arxiv.org/abs/2403.04063 |