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

In this paper, we generalize the General Lotto game and the Colonel Blotto game to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium...

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

Maintaining the security of critical infrastructure networks is vital for a modern economy. This paper examines a game-theoretic model of attack and defense of a network in which the defender's objective is to maintain network connectivity and the attacker's objective is to destroy a set of...

We consider a class of incomplete-information Colonel Blotto games in which N ≥ 2 agents are engaged in (N + 1) battlefields. An agent's vector of battlefield valuations is drawn from a generalized sphere in L_p-space. We identify a Bayes-Nash equilibrium in which any agent's resource...