Distributionally Robust Optimal Auction Design under Mean Constraints

Ethan Che

Papers from arXiv.org

Abstract: We study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly asymmetric) means of the marginal distributions of each bidder's valuation and the range. An adversarial nature chooses the worst-case distribution within this ambiguity set along with the worst-case information structure. We find that a second-price auction with a symmetric, random reserve price obtains the optimal revenue guarantee within a broad class of mechanisms we refer to as competitive mechanisms, which include standard auction formats, including the first-price auction, with or without reserve prices. The optimal mechanism possesses two notable characteristics. First, the mechanism treats all bidders identically even in the presence of ex-ante asymmetries. Second, when bidders are identical and the number of bidders $n$ grows large, the seller's optimal reserve price converges in probability to a non-binding reserve price and the revenue guarantee converges to the best possible revenue guarantee at rate $O(1/n)$.

Date: 2019-11, Revised 2022-02
New Economics Papers: this item is included in nep-des, nep-gth and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://arxiv.org/pdf/1911.07103 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1911.07103

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().