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 consider a best-of-three Tullock contest between two ex-ante identical players. An effort-maximizing designer commits to a vector of player-specific biases (advantages or disadvantages). In our benchmark model the designer chooses victory-dependent biases (i.e., the biases depend on the...

We use a Tullock-type contest to show that intuitively and structurally different contests can be strategically equivalent. Strategically equivalent contests generate the same best response functions and, as a result, the same efforts. Two strategically equivalent contests, however, may yield...

This paper analyzes incumbency contests in a large population setting. Incumbents repeatedly face different challengers, holding on to their positions until defeated in a contest. Defeated incumbents turn into challengers until they win a contest against an incumbent, thereby regaining an...

We consider contestants who must choose exactly one contest, out of several, to participate in. We show that when the contest technology is of a certain type, or when the number of contestants is large, a self-allocation equilibrium, i.e., one where no contestant would wish to change his choice...