ABOUT FINDING ALL NONDOMINATED MAXIMIN STRATEGIES OF ONE OF THE PLAYERS IN A TWO-PERSON NONCOOPERATIVE GAME THAT MODELS A PROCESS OF PURCHASING PROTECTION MEANS FOR A COMPUTER SYSTEM
A two-person noncooperative game that models a process of purchasing protection means for a computer system is considered. One of the players in this game is a party responsible for the security of the system. Having a certain amount of money that can be spent on the purchase of the protection means this party determines which of these funds should be purchased. Actions of the other player (and it’s the external world in relation to the computer system) are attacks on the computer system implemented via the network. For each of the protection means that can be purchased as well as for each of the types of attacks that can be used in an assault on the computer system a probability with which the attack will be reflected by the protection mean is known. By choosing the protection means a party responsible for the security seeks to minimize overall losses which include first a cost of the purchased protection means and secondly a damage expected from use of the other party attacks on the computer system. A study of an optimality principle implementations of which are nondominated maximin strategies of a player, which is a party responsible for ensuring the security of the system, is carried out. A result of this study is statements that determine a method of finding all nondominated maximin strategies of the specified player.
Keywords: noncooperative game, maximin strategy, nondominated strategy, computer system, attack on a computer system, protection of a computer system.