We study equilibrium in a multistage race in which players compete in a sequence of simultaneous move component contests. Players may win a prize for winning each component contest, as well as a prize for winning the overall race. Each component contest is an all-pay auction with complete...

This paper considers all-pay contests in which the relationship between bids and allocation reflects a small amount of noise. Prior work had focused on one particular equilibrium. However, there may be other equilibria. To address this issue, we introduce a new and intuitive measure for the...

This paper considers rent-seeking games in which a small percentage change in a player's bid has a large percentage impact on her odds of winning, i.e., on the ratio of her respective probabilities of winning and losing. An example is the Tullock contest with a high R. The analysis provides a...

This paper provides a different approach to establish the uniqueness of equilibrium in Tullock con- tests between two players with asymmetric valuations, when the discriminatory power r is between 1 and 2. Our result complements that of Ewerhart (2017) in Ölling up the remaining gap in the...

This paper considers all-pay contests in which the relationship between bids and allocations reflects a small amount of noise. Prior work had focused on one particular equilibrium. However, there may be other equilibria. To address this issue, we introduce a new and intuitive measure for the...

We consider imperfectly discriminating, common-value, all-pay auctions (or contests) where some players know the value of the prize, others do not. We show that if the prize is always of positive value, then all players are active in equilibrium. If the prize is of value zero with positive...

This paper analyzes a tug of war contest between two teams. In each round of the tug of war a pair of agents from the opposing teams competes in a private value all-pay auction with asymmetric type distributions and effort effectiveness. Whichever team arrives first at a given lead in terms of...

We investigate a version of the classic Colonel Blotto game in which individual battles may have different values. Two players allocate a fixed budget across battlefields and each battlefield is won by the player who allocates the most to that battlefield. The winner of the game is the player...

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

We develop a model of contests on networks. Each player is “connected” to a set of contests and exerts a single effort to increase the probability of winning each contest to which she is connected. We characterize equilibria under the Tullock contest success function and explore how behavior...