The theoretical literature on asymmetric first-price auctions has focused mainly on settings with either (1) exactly two bidders or (2) an arbitrary number of bidders with types in a common support. Even though closed form solutions are typically impossible, there is enough structure in the...

In models of first-price auctions, when bidders are ex ante heterogenous, deriving explicit equilibrium bid functions is typically impossible, so numerical methods (such as polynomial approximations) are often employed to find approximate solutions. Recent theoretical research concerning...

The revenue ranking of asymmetric auctions with two heterogenous bidders is examined. The main theorem identifies a general environment in which the first-price auction is more profitable than the second-price auction. By using mechanism design techniques, the problem is simplified and several...

In a deterministic contest or all-pay auction, all rents are dissipated when information is complete and contestants are identical. As one contestant becomes "stronger", that is, values the prize more, total expenditures are known to decrease monotonically. Thus, asymmetry among contestants...

In many contests a subset of contestants is granted preferential treatment which is presumably intended to be advantageous. Examples include affirmative action and biased procurement policies. In this paper, however, I show that some of the supposed beneficiaries may in fact become worse off...

We examine a contest, modelled as an all-pay auction, in which a strong and a weak contestant compete, and where a contestant may suffer from a handicap or benefit from a head start. The former reduces the contestant's score by a fixed percentage; the latter is an additive bonus. The two...

Comparative statics for all-pay auctions with two heterogeneous and privately informed bidders are analyzed. General results are provided for when one bidder becomes stochastically weaker. The comparative statics are fully characterized for truncations. Moreover, we show that expected revenue...

In this paper, we propose a new approach to analyzing asymmetric first price auctions. Specifically, we examine winning probabilities, exploiting the connection between winning probabilities and payoffs known from mechanism design. This circumvents the need to look directly at bidding...