A progressive increase in the complexity and diversity of the objects of study of the theory of protection of the information determines the relevance of development and the subsequent development is quite simple and universal mathematical models which describe the dynamics of what is happening in reality processes.
At the same time, the most difficult in theoretical terms is traditionally the formalization of the processes of information protection from unauthorized access, due to the complexity of forecasting specific human activities. The conflicting nature of such processes suggests the preference for the use of mathematical methods of the theory of non-coalition multistep games. However, the use of these methods is associated with the determination of the win functions of the parties in the final positions of the tree graph describing the conflict. The study of winning functions is beyond the framework of game-theoretic methods. To date, there are still no General algorithms for calculating these functions to ensure acceptable reliability of the results.
The article develops the authors previously proposed the idea of partitioning a finite multistage game of two persons with full information on a set of interrelated bimatrix games. Obtaining the calculated values of the winning functions of the parties to the conflict for the intermediate positions of the tree graph provides the researcher with a lot of new opportunities associated primarily with the targeted improvement of the methods and tools used and guaranteed achievement of specific goals. At the same time be available to the mechanisms of evaluation of efficiency of application of some protection/opening information based on a modern interpretation of the models bimatrix games with elements of informational or strategic reflection.