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

We analyze equilibria of two-player contests where players have intention-based preferences. We find that players invest more effort compared to the case with selfish preferences and are even willing to exert effort when the monetary value of the prize converges to zero. As a consequence,...

I present a two-player nested contest which is a convex combination of two widely studied contests: the Tullock (lottery) contest and the all-pay auction. A Nash equilibrium exists for all parameters of the nested contest. If and only if the contest is sufficiently asymmetric, then there is an...

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