攻防博弈的模拟与博弈论分析
1. 模拟过程
1.1 算法描述
以下是模拟过程的算法:
# Algorithm 1. Simulation procedure
for s in {0.1, 0.2, ..., 1}:
for a in {1, 2, ..., 10}:
for strategya in {PROPORTIONAL, HIGH}:
for strategyd in {NOTHING, PROPORTIONAL, HIGH}:
for e′i in {0.1, 0.2, ..., 0.9}:
Ua = []
Ud = []
for _ in range(50000):
machineValues = [random.randint(1, 100) for _ in range(3)]
# Defender secures machines according to strategyd
# Attacker attacks machine(s) according to strategya
if Attacker successfully penetrates a machine:
超级会员免费看
订阅专栏 解锁全文
438

被折叠的 条评论
为什么被折叠?



