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 Lp-space. We identify a Bayes-Nash equilibrium in which any agent's resource...

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

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

In this paper, we study N-player Colonel Blotto games with incomplete information about battlefield valuations. Such games arise in job markets, research and development, electoral competition, security analysis, and conflict resolution. For M ≥ N + 1 battlefields, we identify a Bayes-Nash...