We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts 'early' and a group of players who choose 'late'. Only the...

In the equilibrium of the all-pay auction with two groups of individual players who move sequentially, only the player with the lowest effort cost has a positive payoff. This payoff and the overall dissipation crucially depend on group composition.

We characterize the equilibrium of the all-pay auction with general convex cost of effort and sequential effort choices. We consider a set of n players who are arbitrarily partitioned into a group of players who choose their efforts ?early? and a group of players who choose ?late?. Only the...

This paper reviews theoretical issues surrounding transport safety modeling and the implications for road safety policy. The behavioral mechanisms that affect transport safety are typically not considered in safety modeling. These issues are discussed in the context of trade-offs between...

We come close to characterizing the class of social choice correspondences that are implementable in rationalizable strategies. We identify a new condition, which we call set-monotonicity, and show that it is necessary and almost sufficient for rationalizable implementation. Set-monotonicity is...

Recent literature has shown that all-pay auctions raise more money for charity than winner-pay auctions. We demonstrate that the first and second-price winner-pay auctions generate higher revenue than first-price all-pay auctions when bidders are sufficiently asymmetric. To prove it, we consider...