Multistage Attack Graph Security Games: Heuristic Strategies, with Empirical Game-Theoretic Analysis

Algorithm 3

Random Activation.

1 Input: , , and topological order of , ;

2 Initialize , , and , for all active nodes ;

3 Initialize , , and for all inactive root nodes ;

4  for    do

5if    then

6Randomly choose a precondition to activate with probability

;

7Update ;

8Update ;

9Update ;

10else

11Update with respect to all preconditions ;

12Update ;

13Update ;

14 Return ;