TY - GEN
T1 - Smoothed analysis of multi-item auctions with correlated values?
AU - Psomas, Alexandros
AU - Schvartzman, Ariel
AU - Weinberg, S. Matthew
PY - 2019/6/17
Y1 - 2019/6/17
N2 - Consider a seller withm heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal revenue is infinite, but the best "simple" mechanism achieves revenue at most one (Briest et al. [2], Hart and Nisan [6]), even whenm = 2. This result has long served as a cautionary tale discouraging the study of multi-item auctions without some notion of "independent items". In this work we initiate a smoothed analysis of such multi-item auction settings. We consider a buyer whose item values are drawn from an arbitrarily correlated multi-dimensional distribution then randomly perturbed with magnitude δ under several natural perturbation models. On one hand, we prove that the [2, 6] construction is surprisingly robust to certain natural perturbations of this form, and the infinite gap remains. On the other hand, we provide a smoothed model such that the approximation guarantee of simple mechanisms is smoothed-finite. We show that when the perturbation has magnitude δ, pricing only the grand bundle guarantees an O(1/δ)-approximation to the optimal revenue. That is, no matter the (worst-case) initially correlated distribution, these tiny perturbations suffice to bring the gap down from infinite to finite. We further show that the same guarantees hold when n buyers have values drawn from an arbitrarily correlated mn-dimensional distribution (without any dependence on n). Taken together, these analyses further pin down key properties of correlated distributions that result in large gaps between simplicity and optimality.
AB - Consider a seller withm heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal revenue is infinite, but the best "simple" mechanism achieves revenue at most one (Briest et al. [2], Hart and Nisan [6]), even whenm = 2. This result has long served as a cautionary tale discouraging the study of multi-item auctions without some notion of "independent items". In this work we initiate a smoothed analysis of such multi-item auction settings. We consider a buyer whose item values are drawn from an arbitrarily correlated multi-dimensional distribution then randomly perturbed with magnitude δ under several natural perturbation models. On one hand, we prove that the [2, 6] construction is surprisingly robust to certain natural perturbations of this form, and the infinite gap remains. On the other hand, we provide a smoothed model such that the approximation guarantee of simple mechanisms is smoothed-finite. We show that when the perturbation has magnitude δ, pricing only the grand bundle guarantees an O(1/δ)-approximation to the optimal revenue. That is, no matter the (worst-case) initially correlated distribution, these tiny perturbations suffice to bring the gap down from infinite to finite. We further show that the same guarantees hold when n buyers have values drawn from an arbitrarily correlated mn-dimensional distribution (without any dependence on n). Taken together, these analyses further pin down key properties of correlated distributions that result in large gaps between simplicity and optimality.
KW - Approximate mechanism design
KW - Correlated distributions
KW - Multi-item mechanism design
KW - Smoothed analysis
UR - http://www.scopus.com/inward/record.url?scp=85069048772&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85069048772&partnerID=8YFLogxK
U2 - 10.1145/3328526.3329563
DO - 10.1145/3328526.3329563
M3 - Conference contribution
T3 - ACM EC 2019 - Proceedings of the 2019 ACM Conference on Economics and Computation
SP - 417
EP - 418
BT - ACM EC 2019 - Proceedings of the 2019 ACM Conference on Economics and Computation
PB - Association for Computing Machinery, Inc
T2 - 20th ACM Conference on Economics and Computation, EC 2019
Y2 - 24 June 2019 through 28 June 2019
ER -