A theorem on playing the strictly convex-concave continuous antagonistic game with the single positive first player coefficient at its pure strategy in the kernel

Abstract

There has been proved the theorem on the pure strategies solution of the strictly convex-concave continuous antagonistic game, which kernel has the five nonzero parameters and the arbitrary constant. The solution is of the six different forms.