We generalize the Tullock Contest Success Function to allow for ties by introducing a tie-proneness parameter to account for the degree of the importance of ties in the contest. The probability of a tie reaches a maximum when the contestants provide similar efforts and it is increasing in the...

This paper presents an axiomatic characterization of difference-form group contests, that is, contests fought among groups and where their probability of victory depends on the difference of their effective efforts. This axiomatization rests on the property of Absolute Consistency, stating that...

I characterize the optimal accuracy level r of an unbiased Tullock contest between two players with heterogeneous prize valuations. The designer maximizes the winning probability of the strong player or the winner’s expected valuation by choosing a contest with an all-pay auction equilibrium...

What explains significant variation across countries in the use of vote buying instead of campaign promises to secure voter support? This paper explicitly models the tradeoff parties face between engaging in vote buying and making campaign promises, and explores the distributional consequences...

The axiomatic route to the foundation of contest success functions (CSF) has proved to be both useful and prolific. The standard approach in the literature is based on the decision-theoretic notion that choice probabilities should be independent of irrelevant alternatives (Skaperdas, Economic...

The axiomatic route to the foundation of contest success functions (CSF) has proved to be both useful and prolific. The standard approach in the literature is based on the decision-theoretic notion that choice probabilities should be independent of irrelevant alternatives (Skaperdas, Economic...

We model the dynamic contest between two players as a game of tug-of-war with a Tullock contest success function (CSF). We show that (pure strategy) Markov perfect equilibrium of this game exists, and it is unique. In this equilibrium - in stark contrast to a model of tug-of-war with an all pay...

This article examines behavior in the two-player, constant-sum Colonel Blotto game with asymmetric resources in which players maximize the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a...

I characterize the optimal accuracy level r of an unbiased Tullock contest between two players with heterogeneous prize valuations. The designer maximizes the winning probability of the strong player or the winner’s expected valuation by choosing a contest with an all-pay auction equilibrium...

I characterize the optimal accuracy level r of an unbiased Tullock contest between two players with heterogeneous prize valuations. The designer maximizes the winning probability of the strong player or the winner's expected valuation by choosing a contest with an all-pay auction equilibrium...