Finding Teams of Maximum Mutual Respect
Finding Teams of Maximum Mutual Respect
复制标题
DOI：
10.1109/icdm50108.2020.00149
复制
发表时间：
2020-11
期刊：
影响因子：
--
通讯作者：
S. M. Nikolakaki;E. Pitoura;Evimaria Terzi;Panayiotis Tsaparas
中科院分区：
文献类型：
--
作者：
S. M. Nikolakaki;E. Pitoura;Evimaria Terzi;Panayiotis Tsaparas
将具有不同专业知识的专家聚集在一起的团队对于解决复杂问题非常重要。然而，研究表明，仅仅根据人们的能力来组队是不够的。团队成员需要有明确的角色，他们应该相互认可和尊重他们在团队中承担的角色。在本文中，我们定义了MaxMutualRespect问题，这是一个新的团队形成问题，它要求一组专家，每个专家被分配到一个不同的角色，这样，团队成员对其分配的角色的个人获得的总尊重是最大化的。我们证明了问题是np完全的，我们考虑了近似和启发式算法。在实际数据集上的实验表明，我们的问题定义和算法在实践中是有效的，并且产生了直观的结果。
Teams that bring together experts with different expertise are important for solving complex problems. However, research shows that teaming up people simply based on their ability is not enough. Team members need to have clear roles, and they should mutually endorse and respect their teammates for the role they assume on the team. In this paper, we define the MaxMutualRespect problem, a novel team-formation problem that asks for a set of experts, each assigned to a distinct role, such that the total respect that the individuals receive by the rest of the team members for their assigned role is maximized. We show that the problem is NP-complete and we consider approximation and heuristic algorithms. Experiments with real datasets demonstrate that our problem definitions and algorithms work well in practice and yield intuitive results.