Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3328526.3329563acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
extended-abstract
Public Access

Smoothed Analysis of Multi-Item Auctions with Correlated Values

Published: 17 June 2019 Publication History

Abstract

Consider a seller with m 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. 2015, Hart and Nisan 2012), even when m=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 above 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.

References

[1]
Moshe Babaioff, Nicole Immorlica, Brendan Lucier, and S MatthewWeinberg. 2014. A simple and approximately optimal mechanism for an additive buyer. In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. IEEE, 21--30.
[2]
Patrick Briest, Shuchi Chawla, Robert Kleinberg, and S Matthew Weinberg. 2015. Pricing lotteries. Journal of Economic Theory 156 (2015), 144--174.
[3]
Shuchi Chawla, Jason D. Hartline, and Robert Kleinberg. 2007. Algorithmic Pricing via Virtual Valuations. In Proceedings of the 8th ACM Conference on Electronic Commerce (EC '07). ACM, New York, NY, USA, 243--251.
[4]
Shuchi Chawla, Jason D Hartline, David L Malec, and Balasubramanian Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the forty-second ACM symposium on Theory of computing. ACM, 311--320.
[5]
Sergiu Hart and Noam Nisan. 2012. Approximate revenue maximization with multiple items. In Proceedings of the 13th ACM Conference on Electronic Commerce. ACM, 656--656.
[6]
Sergiu Hart and Noam Nisan. 2013. The menu-size complexity of auctions. arXiv preprint arXiv:1304.6116 (2013).
[7]
Jason D. Hartline and Tim Roughgarden. 2009. Simple Versus Optimal Mechanisms. In Proceedings of the 10th ACM Conference on Electronic Commerce (EC '09). ACM, NewYork, NY, USA, 225--234.
[8]
Christos-Alexandros Psomas, Ariel Schvartzman, and S. Matthew Weinberg. 2018. Smoothed Analysis of Multi-Item Auctions with Correlated Values. CoRR abs/1811.12459 (2018). arXiv:1811.12459 http://arxiv.org/abs/1811.12459

Cited By

View all
  • (2023)On the robustness of mechanism design under total variation distanceProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3666202(1620-1629)Online publication date: 10-Dec-2023
  • (2023)Smoothed Analysis of Online Non-parametric AuctionsProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597787(540-560)Online publication date: 9-Jul-2023
  • (2023)Fine-Grained Buy-Many Mechanisms Are Not Much Better Than BundlingProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597662(123-152)Online publication date: 9-Jul-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '19: Proceedings of the 2019 ACM Conference on Economics and Computation
June 2019
947 pages
ISBN:9781450367929
DOI:10.1145/3328526
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2019

Check for updates

Author Tags

  1. approximate mechanism design
  2. correlated distributions
  3. multi-item mechanism design
  4. smoothed analysis

Qualifiers

  • Extended-abstract

Funding Sources

Conference

EC '19
Sponsor:
EC '19: ACM Conference on Economics and Computation
June 24 - 28, 2019
AZ, Phoenix, USA

Acceptance Rates

EC '19 Paper Acceptance Rate 106 of 382 submissions, 28%;
Overall Acceptance Rate 664 of 2,389 submissions, 28%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)58
  • Downloads (Last 6 weeks)13
Reflects downloads up to 22 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)On the robustness of mechanism design under total variation distanceProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3666202(1620-1629)Online publication date: 10-Dec-2023
  • (2023)Smoothed Analysis of Online Non-parametric AuctionsProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597787(540-560)Online publication date: 9-Jul-2023
  • (2023)Fine-Grained Buy-Many Mechanisms Are Not Much Better Than BundlingProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597662(123-152)Online publication date: 9-Jul-2023
  • (2022)On infinite separations between simple and optimal mechanismsProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3600618(4818-4829)Online publication date: 28-Nov-2022
  • (2022)Buy-many mechanisms are not much better than item pricingGames and Economic Behavior10.1016/j.geb.2022.04.003Online publication date: Apr-2022
  • (2022)Beyond the Worst Case: Semi-random Complexity Analysis of Winner DeterminationWeb and Internet Economics10.1007/978-3-031-22832-2_19(330-347)Online publication date: 9-Dec-2022
  • (2021)On Simple Mechanisms for Dependent ItemsProceedings of the 22nd ACM Conference on Economics and Computation10.1145/3465456.3467643(242-262)Online publication date: 18-Jul-2021
  • (2020)Buy-many mechanismsACM SIGecom Exchanges10.1145/3440959.344096318:1(12-18)Online publication date: 2-Dec-2020
  • (2020)Menu-size Complexity and Revenue Continuity of Buy-many MechanismsProceedings of the 21st ACM Conference on Economics and Computation10.1145/3391403.3399453(475-476)Online publication date: 13-Jul-2020

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media