We study the role of information exchange through alliances in a framework with contestants who have binding budget limits and know their own budget limit but are incompletely informed about other contestants' budget limits. First, we solve for the Bayesian Nash equilibrium. Then we consider the...

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts "early"; and a group of players who choose "late". Only the...