We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent and both players are budget-constrained. We generalize the results for all-pay auctions with complete information,...

We study two-player common-value all-pay auctions in which the players have ex-ante asymmetric information represented by finite partitions of the set of possible values of winning. We consider two families of such auctions: in the first, one of the players has an information advantage...