There has been found the optimal strategy of the second player in the convex antagonistic game with the kernel as a function of 2N – 2 variables on the parallelepiped in 2N–2 , that is a model of removing N partial indeterminancies of the probabilistic type as maximal disbalance minimization. In the form of multistage diagonal NN-game there has been represented a model of optimally distributing the search resources for organizing the search process with the dispatcher with regard to a physical nature object.
partial indeterminancy, antagonistic game, game convexity, maximal disbalance minimization, optimal strategy, search model, search process, diagonal game, decision making
"Modeliuvannia poshukiv obiekta v umovakh chastkovoi nevyznachenosti z vykorystanniam zahalnoi modeli usunennia chastkovykh nevyznachenostei imovirnisnoho typu yak minimizatsii maksymalnoho dysbalansu" ,
Systems of Arms and Military Equipment,