Fight or Flight?: Defending against Sequential Attacks in the Game of Siege

被引:47
作者
Deck, Cary [1 ,2 ]
Sheremeta, Roman M. [3 ]
机构
[1] Univ Arkansas, Dept Econ, Fayetteville, AR 72701 USA
[2] Chapman Univ, Econ Sci Inst, Orange, CA USA
[3] Chapman Univ, Argyros Sch Business & Econ, Orange, CA USA
关键词
Colonel Blotto; conflict resolution; weakest link; game of siege; multiperiod resource allocation; experiments; SYSTEMS DEFENSE GAMES; COLONEL-BLOTTO; WEAKEST-LINK; CONTESTS; RESOURCES; INFORMATION; COMPETITION; ALLOCATION; AUCTIONS; FALLACY;
D O I
10.1177/0022002712438355
中图分类号
D81 [国际关系];
学科分类号
030207 ;
摘要
This article examines theory and behavior in a two-player game of siege, sequential attack and defense. The attacker's objective is to successfully win at least one battle, while the defender's objective is to win every battle. Theoretically, the defender either folds immediately or, if his valuation is sufficiently high and the number of battles is sufficiently small, then he has a constant incentive to fight in each battle. Attackers respond to defense with diminishing assaults over time. Consistent with theoretical predictions, the authors' experimental results indicate that the probability of successful defense increases in the defenders valuation and it decreases in the overall number of battles in the contest. However, the defender engages in the contest significantly more often than predicted and the aggregate expenditures by both parties exceed predicted levels. Moreover, both defenders and attackers actually increase the intensity of the fight as they approach the end of the contest.
引用
收藏
页码:1069 / 1088
页数:20
相关论文
共 44 条