The graph theoretic formulation of the team formation problem based on the factor of competition

Anton Riabenko (), Elina Tereschenko, Anna Bakurova, Andrii Pyrozhok and Olexiy Kuzkin
Additional contact information
Anton Riabenko: National University «Zaporizhzhia Polytechnic»
Elina Tereschenko: National University «Zaporizhzhia Polytechnic»
Anna Bakurova: National University «Zaporizhzhia Polytechnic»
Andrii Pyrozhok: National University «Zaporizhzhia Polytechnic»
Olexiy Kuzkin: National University «Zaporizhzhia Polytechnic»

Technology audit and production reserves, 2024, vol. 4, issue 4(78), 25-30

Abstract: The object of the research is to increase the level of productivity of teamwork due to the effective selection of participants who demonstrate the highest level of productivity in cooperation. The presented research is aimed at the mathematical formalization of the problem of team formation based on the results of a series of competitions using graph-theoretic approaches. Each competition in this series involves teams with the same number of participants. The composition of the team necessarily changes for each subsequent competition.After the competitive series, the obtained information about the teams' composition and their results is evaluated for the success of the interaction of the participants, which can be used in the formation of successful teams. A graph-theoretic formalization of the team formation problem on a complete undirected weighted graph has been developed. The set of vertices of this graph corresponds to the set of potential participants. Each edge is weighted with a number that reflects the quality of the interaction between the two participants. A valid solution is to cover the graph with cliques, the size of which is determined by the number of team members. A mathematical model of a two-criterion problem with MAXSUM and MAXMIN criteria was built, where the first criterion evaluates the overall success of the created teams, the second criterion evaluates the «weakest link», allowing to choose the option that maximizes the minimum edge weights for each clique. A two-criterion objective function defines a Pareto set consisting of all Pareto optima in the set of admissible solutions. The algorithmic problem of finding the complete set of alternatives, which is a subset of the Pareto set of minimum power when the condition of equality of the objective functions for the complete set of alternatives and the Pareto set is fulfilled, is considered. The weight of the edges of the graph is calculated using the scores obtained during the series of competitions. In practice, the research results can be used as a basis for the development of team building techniques.

Keywords: teamwork; pareto set; multi-criteria objective functions; graph; multi-criteria optimization; competition (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.uran.ua/tarp/article/download/310570/302067 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:baq:taprar:v:4:y:2024:i:4:p:25-30

DOI: 10.15587/2706-5448.2024.310570

Access Statistics for this article

More articles in Technology audit and production reserves from PC TECHNOLOGY CENTER
Bibliographic data for series maintained by Iryna Prudius ().