Open Access. Powered by Scholars. Published by Universities.®

Economic Theory Commons

Open Access. Powered by Scholars. Published by Universities.®

ESI Working Papers

Colonel Blotto

Publication Year

Articles 1 - 5 of 5

Full-Text Articles in Economic Theory

The Attack And Defense Of Weakest Link Networks, Dan Kovenock, Brian Roberson, Roman M. Sheremeta Aug 2017

The Attack And Defense Of Weakest Link Networks, Dan Kovenock, Brian Roberson, Roman M. Sheremeta

ESI Working Papers

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 successfully attack at least one target 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 randomly attacking at most one target with a random level of force. Inconsistent with equilibrium in …


Focality And Asymmetry In Multi-Battle Contests, Subhashish M. Chowdhury, Dan Kovenock, David Rojo Arjona, Nathaniel Wilcox Aug 2016

Focality And Asymmetry In Multi-Battle Contests, Subhashish M. Chowdhury, Dan Kovenock, David Rojo Arjona, Nathaniel Wilcox

ESI Working Papers

This article examines behavior in two-person constant-sum Colonel Blotto games in which each player maximizes the expected total value of the battlefields won. A lottery contest success function is employed in each battlefield. Recent experimental research on such games provides only partial support for Nash equilibrium behavior. We hypothesize that the salience of battlefields affects strategic behavior (the salient target hypothesis). We present a controlled test of this hypothesis – against Nash predictions – when the sources of salience come from certain asymmetries in either battlefield values or labels (as in Schelling (1960)). In both cases, subjects over-allocate the resource …


Do Prediction Markets Aid Defenders In A Weak‐Link Contest?, Cary Deck, Li Hao, David Porter Jan 2013

Do Prediction Markets Aid Defenders In A Weak‐Link Contest?, Cary Deck, Li Hao, David Porter

ESI Working Papers

Laboratory experiments have demonstrated that prediction market prices weakly aggregate the disparate information of the traders about states (moves) of nature. However, in many practical applications one might want to predict the move of a strategic participant. This is particularly important in aggressor‐defender contests. This paper reports a set of such experiments where the defender may have the advantage of observing a prediction market on the aggressor’s action. The results of the experiments indicate that: the use of prediction markets does not increase the defender’s win rate; prediction markets contain reliable information regarding aggressors’ decisions, namely excess bid information, that …


The Attack And Defense Of Weakest-Link Networks, Dan Kovenock, Brian Roberson, Roman M. Sheremeta Jan 2010

The Attack And Defense Of Weakest-Link Networks, Dan Kovenock, Brian Roberson, Roman M. Sheremeta

ESI Working Papers

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


Fight Or Flight? Defending Against Sequential Attacks In The Game Of Siege, Cary Deck, Roman M. Sheremeta Jan 2010

Fight Or Flight? Defending Against Sequential Attacks In The Game Of Siege, Cary Deck, Roman M. Sheremeta

ESI Working Papers

This paper 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, our experimental results indicate that the probability of successful defense increases in the defenders valuation and it decreases in …