Optimal auctions vs. anonymous pricing

Saeed Alaei, Jason Hartline, Rad Niazadeh, Emmanouil Pountourakis and Yang Yuan

Games and Economic Behavior, 2019, vol. 118, issue C, 494-510

Abstract: For selling a single item to agents with independent but non-identically distributed values, the revenue optimal auction is complex. With respect to it, Hartline and Roughgarden (2009) showed that the approximation factor of the second-price auction with an anonymous reserve is between two and four. We consider the more demanding problem of approximating the revenue of the ex ante relaxation of the auction problem by posting an anonymous price and derive a formula for their worst-case ratio, denoted ρ, that numerically evaluates to e. As a corollary, the upper-bound of anonymous pricing or anonymous reserves versus the optimal auction improves from four to ρ≈e. We conclude that, up to the factor ρ, discrimination and simultaneity are unimportant for driving revenue in single-item auctions.

Keywords: Auction theory; Mechanism design; Second price auction; Anonymous pricing; Optimal auction (search for similar items in EconPapers)
JEL-codes: D44 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S089982561830126X
Full text for ScienceDirect subscribers only

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:eee:gamebe:v:118:y:2019:i:c:p:494-510

DOI: 10.1016/j.geb.2018.08.003

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().