Optimal disclosure in all-pay auctions with interdependent valuations

We study all-pay auctions with one-sided private information and interdependent valuations. To sharpen the competition and maximize revenue, the auction organizer can design an information disclosure policy through Bayesian persuasion about the bidder with private information. We characterize optimal disclosure and find that optimal disclosure exhibits almost full disclosure, where the uninformed bidder can always narrow the informed bidder's private information down to at most two types. We also illustrate our characterization in a simple binary-type setting and investigate issues such as comparative statics, welfare, and efficiency.