This article proposes a close labor force allocation model based on the use of a competitive mechanism. Many practical economic activity tasks and some economic theory issues are associated with the tasks of determining the optimal variant for solving the problem of the distribution of labor resources. One of these solutions is a compromise set. This article is devoted to the search for this set in a non-antagonistic non-coalition game related to the transport problem of integer programming.