Solution of the coalition game in the program strategy under uncertainty

The abstract game models of conflict are widely used in practice in solving problems of management systems of different nature. The paper constructs a mathematical model of differential game of two coalitions with uncertainty in program strategies, considers antagonistic interaction between coalitions, defines the solutions using the principle of a guaranteed result. Application of the method of penalty functions has transformed the original maxmin problem in the related sets to the task for maximum. The paper proves the existence theorem for solutions to problems with penalties, an estimate of the error, matching conditions penalty constants and optionally-necessary condition of optimality.