There has been proved the theorem on the seven solution types of a strictly convex-concave antagonistic game with the kernel on the unit square. Each solution, being stated exclusively in the pure strategies of the players, is determined by the definite aggregate of relationships between the five kernel parameters.
convex-concave antagonistic game, game solution, unit square, pure strategy, game kernel parameters
"Teorema pro sim rozviazkiv odniiei stroho opuklo-vhnutoi antahonistychnoi hry z yadrom na odynychnomu kvadrati" ,
Information Processing Systems,