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

In a canonical model of military conflict, victory and defeat depend stochastically on the difference of resources deployed by the conflict parties. The present paper offers a comprehensive analysis of that model. The unique Nash equilibrium reflects either (i) peace, (ii) submission, (iii)...

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

Considered are imperfectly discriminating contests in which players may possess private information about the primitives of the game, such as the contest technology, valuations of the prize, cost functions, and budget constraints. We find general conditions under which a given contest of...

We characterize the equilibrium set of the n-player Hirshleifer contest with homogeneous valuations. A symmetric equilibrium always exists. It necessarily corresponds to multilateral peace for sufficient noise and uses finite-support randomized strategies otherwise. Asymmetric equilibria are...

At the time of writing, the Riemann Hypothesis (RH) is one of the major unsolved problems in pure mathematics. In this note, a parameterized family of non-cooperative games is constructed with the property that, if RH holds true, then any game in this family admits a unique Nash equilibrium