The Attack and Defense of Weakest-Link Networks

摘要: This paper experimentally examines behavior in a two-player game of attack and defense weakest-link network targets, which the attacker’s objective is to successfully at least one target defender’s diametrically opposed. We apply two benchmark contest success functions (CSFs): auction CSF lottery CSF. Consistent with theoretical prediction, under CSF, attackers utilize stochastic “guerilla warfare” strategy — single random attacked more than 80% time. Under guerilla warfare almost 45% time, contrary prediction an equal allocation forces across targets.