We study bribing in a sequential team contest with multiple pairwise battles. We allow for asymmetries in winning prizes and marginal costs of effort; and we characterize the conditions under which (i) a player in a team is offered a bribe by the owner of the other team and (ii) she accepts the...

We generalize Klumpp, Konrad and Solomon's model (KKS Model) to multi-contestant sequential Colonel Blotto Games with prize functions where any contestant's prizes only depend on this contestant's own number of winning rounds. We show that with weakly monotonic prize functions and CSFs...

We consider a model of common-value sequential voting in which voters are differentiated in their information. We ask whether the intuition as in the simultaneous-voting case---voters with no information would vote so as not to influence the outcome---would be valid to imply long voting in our...

We study a model of imperfectly discriminating contests with two ex ante symmetric agents. We consider four institutional settings: Contestants move either sequentially or simultaneously and in addition their types are either public or private information. We find that an effort-maximizing...

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