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

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

We study group competition with a single public good prize, perfectly discriminating contest success function, and the weakest-link effort technology, in which the marginal cost of effort for each player is private information. We focus on pure strategy Bayes-Nash equilibria and show that...