An Optimal Distributionally Robust Auction

Alex Suzdaltsev

Papers from arXiv.org

Abstract: An indivisible object may be sold to one of $n$ agents who know their valuations of the object. The seller would like to use a revenue-maximizing mechanism but her knowledge of the valuations' distribution is scarce: she knows only the means (which may be different) and an upper bound for valuations. Valuations may be correlated. Using a constructive approach based on duality, we prove that a mechanism that maximizes the worst-case expected revenue among all deterministic dominant-strategy incentive compatible, ex post individually rational mechanisms is such that the object should be awarded to the agent with the highest linear score provided it is nonnegative. Linear scores are bidder-specific linear functions of bids. The set of optimal mechanisms includes other mechanisms but all those have to be close to the optimal linear score auction in a certain sense. When means are high, all optimal mechanisms share the linearity property. Second-price auction without a reserve is an optimal mechanism when the number of symmetric bidders is sufficiently high.

Date: 2020-06, Revised 2020-08
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 (8)

Downloads: (external link)
http://arxiv.org/pdf/2006.05192 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:2006.05192

Access Statistics for this paper

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