ALLOCATION OF PRIZES IN CONTESTS WITH PARTICIPATION CONSTRAINTS

We study all-pay contests with an exogenous minimal effort constraint where a player can participate in a contest only if his effort (output) is equal to or higher than the minimal effort constraint. Contestants are privately informed about a parameter (ability) that affects their cost of effort. The designer decides about the size and the number of prizes. We analyze the optimal prize allocation for the contest designer who wishes to maximize either the total effort or the highest effort. It is shown that if the minimal effort constraint is relatively high, the winner-take-all contest in which the contestant with the highest effort wins the entire prize sum does not maximize the expected total effort nor the expected highest effort. In that case, the random contest in which the entire prize sum is equally allocated to all the participants yields a higher expected total effort as well as a higher expected highest effort than the winner-take-all contest.Winner-take-all contests, all-pay auctions, participation constraints.

Sequential Contests with Synergy and Budget Constraints

We study a sequential Tullock contest with two stages and two identical prizes. The players compete for one prize in each stage and each player may win either one or two prizes. The players have either decreasing or increasing marginal values for the prizes, which are commonly known, and there is a constraint on the total effort that each player can exert in both stages. We analyze the players' allocations of efforts along both stages when the budget constraints (effort constraints) are either restrictive, nonrestrictive or partially restrictive. We show that when the players are either symmetric or asymmetric and the budget constraints are restrictive, independent of the players' values for the prizes, each player allocates his effort equally along both stages of the contest.budget constraints; sequential contests; Tullock contests

Caps in Sequential Contests

We study a sequential two-stage all-pay auction with two identical prizes. In each stage, the players compete for one prize and each player may win either one or two prizes. The designer may impose a cap on the players' bids in each of the stages. We analyze the equilibrium in this sequential all-pay auction with bid caps and show that capping the players' bids is profitable for a designer who wishes to maximize the players' expected total bid.All-pay auctions; Bid caps; Multi-stage contests