Consider a seller that intends to auction some item. The seller can invest money and effort in advertising in different market segments in order to recruit n bidders to the auction. Alternatively, the seller can have a much cheaper and focused marketing operation and recruit the same number of bidders from a single market segment. Which marketing operation should the seller choose? More formally, let D=D1,..., Dn be a set of distributions. Our main result shows that there is always Di∈ D such that the revenue that can be extracted from n bidders, where the value of each is independently drawn from Di, is at least 1/2 · (1-1/e) of the revenue that can be obtained by any possible mix of bidders, where the value of each bidder is drawn from some (possibly different) distribution that belongs to D. We next consider situations in which the auctioneer cannot use the optimal auction and is required to use a second price auction. We show that there is always Di∈ D such that if the value of all bidders is independently drawn from Di then running a second price auction guarantees a constant fraction of the revenue that can be obtained by a second-price auction by any possible mix of bidders. Finally, we show that for any ε>0 there exists a function f that depends only on ε (in particular, the function does not depend on n or on the set D), such that recruiting n bidders which have at most f(ε) different distributions, all from D, guarantees (1-ε)-fraction of the revenue that can be obtained by a second-price auction by any possible mix of bidders.
[1]
Amir Ronen,et al.
On approximating optimal auctions
,
2001,
EC '01.
[2]
Vasilis Syrgkanis,et al.
Vickrey Auctions for Irregular Distributions
,
2013,
WINE.
[3]
Shuchi Chawla,et al.
Multi-parameter mechanism design and sequential posted pricing
,
2010,
BQGT.
[4]
David Eppstein,et al.
The minimum expectation selection problem
,
2002,
Random Struct. Algorithms.
[5]
Jon M. Kleinberg,et al.
Team Performance with Test Scores
,
2015,
EC.
[6]
Tim Roughgarden,et al.
Simple versus optimal mechanisms
,
2009,
SECO.
[7]
Roger B. Myerson,et al.
Optimal Auction Design
,
1981,
Math. Oper. Res..
[8]
S. Matthew Weinberg,et al.
Matroid prophet inequalities
,
2012,
STOC '12.
[9]
S. Matthew Weinberg,et al.
The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders
,
2016,
EC.
[10]
Aranyak Mehta,et al.
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics
,
2020,
NeurIPS.
[11]
Hu Fu,et al.
The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue
,
2019,
EC.
[12]
Michal Feldman,et al.
99% Revenue via Enhanced Competition
,
2018,
EC.