In this paper, we generalize the General Lotto game (budget constraints satisfied in expectation) and the Colonel Blotto game (budget constraints hold with probability one) to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the...

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine "spillover" effects that depend on the rank-order of her decision...

This article examines behavior in the two-player, constant-sum Colonel Blotto game with asymmetric resources in which players maximize the expected number of battlefields won. The experimental results support the main qualitative predictions of the theory. In the auction treatment, where winning...

This paper examines conflicts in which performance is measured by the players' success or failure in multiple component conflicts, commonly termed "battlefields." In multi-battlefield conflicts, behavioral linkages across battlefields depend both on the technologies of conflict within each...

This article examines behavior in the two-player, constant-sum Colonel Blotto game with asymmetric resources in which players maximize the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a...

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player’s strategy generates direct or indirect affine “spillover” effects that depend on the rank-order of her...

In the Colonel Blotto game, each of two players simultaneously allocates his fixed budget of a resource across a finite number n of battleelds. Within each battlefield, the player that allocates the higher level of the resource wins the battlefield. Each player's payoff is equal to the sum of...

Hausken (2008a) formulates a contest-theoretic model of the attack and defense of a network of targets. This note identies a technical error that invalidates Hausken's characterization of Nash equilibrium for a substantial portion of the parameter space that he examines and provides necessary...

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...

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...