Revenue maximization with a single sample

被引:79
作者
Dhangwatnotai, Peerapong [1 ]
Roughgarden, Tim [1 ]
Yan, Qiqi [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
基金
美国国家科学基金会;
关键词
Auctions; Approximation; Revenue-maximization; Prior-independence; MECHANISMS;
D O I
10.1016/j.geb.2014.03.011
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper pursues auctions that are prior-independent. The goal is to design an auction such that, whatever the underlying valuation distribution, its expected revenue is almost as large as that of an optimal auction tailored for that distribution. We propose the prior-independent Single Sample mechanism, which is essentially the Vickrey-Clarke-Groves (VCG) mechanism, supplemented with reserve prices chosen at random from participants' bids. We prove that under reasonably general assumptions, this mechanism simultaneously approximates all Bayesian-optimal mechanisms for all valuation distributions. Conceptually, our analysis shows that even a single sample from a distribution some bidder's valuation - is sufficient information to obtain near-optimal expected revenue. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:318 / 333
页数:16
相关论文
共 31 条
[1]  
[Anonymous], 2011, Matroid Theory
[2]  
[Anonymous], 2003, Combinatorial Optimization: Polyhedra and Efficiency
[3]  
Archer A, 2001, ANN IEEE SYMP FOUND, P482
[4]  
Azar P, 2013, PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), P596
[5]  
Baliga S., 2003, ADV THEOR EC, V3, P5
[6]   Robust mechanism design [J].
Bergemann, D ;
Morris, S .
ECONOMETRICA, 2005, 73 (06) :1771-1813
[7]  
Briest P., 2005, STOC 05 P THIRTYSEVE, P39
[8]  
Bulow J, 1996, AM ECON REV, V86, P180
[9]  
Caillaud Bernard., 2005, Review of Economic Design, V9, P127
[10]  
Chawla S, 2013, STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, P51