Munich Personal RePEc Archive

The attack and defense of weakest-link networks

Kovenock, Dan and Roberson, Brian and Sheremeta, Roman (2018): The attack and defense of weakest-link networks. Forthcoming in: Public Choice

[img]
Preview
PDF
MPRA_paper_89292.pdf

Download (286kB) | Preview

Abstract

We experimentally test the qualitatively different equilibrium predictions of two theoretical models of attack and defense of a weakest-link network of targets. In such a network, the attacker’s objective is to assault at least one target successfully and the defender’s objective is to defend all targets. The models differ in how the conflict at each target is modeled — specifically, the lottery and auction contest success functions (CSFs). Consistent with equilibrium in the auction CSF model, attackers utilize a stochastic “guerrilla-warfare” strategy, which involves attacking at most one target arbitrarily with a random level of force. Inconsistent with equilibrium in the lottery CSF model, attackers use the “guerrilla-warfare” strategy and assault only one target instead of the equilibrium “complete-coverage” strategy that attacks all targets. Consistent with equilibrium in both models, as the attacker’s valuation increases, the average resource expenditure, the probability of winning, and the average payoff increase (decrease) for the attacker (defender).

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.