The paper considers a game-theoretic model for supporting the distribution of labor resources, i.e. To simulate the problem considered in the work, the mathematical apparatus of game theory was used. In this paper, two algorithms for constructing a solution are described and examined in detail for two models of transport tasks used to study the distribution of labor resources: static and dynamic. The authors describe the developed models, and then consider the structure of the solution to the problem. The paper considers a compromise solution in the models of the distribution of labor resources for the transportation problem. An algorithm for finding a compromise set and a description of the structure of the software implementation of models is given. The description of the models is formalized in the field of application to game theory, i.e., a game version of the problem is considered. Interpreting the problem, we consider a system consisting of players. Players in the constructed model strive, in addition to maximizing profits, to achieve a compromise between the participants. The role of compromise will be played by a plan of movement of labor resources, satisfying all participants. As a result, we obtain the transportation problem in a slightly modified formulation. These differences specify a new task and set a goal to solve it.
Keywords: modeling, analysis, management, software implementation, game-theoretic models, distribution of labor resources