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...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We characterize the unique Markov perfect equilibrium of a tug-of-war without exogenous noise, in which players have the opportunity to engage in a sequence of battles in an attempt to win the war. Each battle is an all-pay auction in which the player expending the greater resources wins. In...