DeepAI AI Chat
Log In Sign Up

Smoothed Analysis of Multi-Item Auctions with Correlated Values

by   Christos-Alexandros Psomas, et al.
Princeton University
Carnegie Mellon University

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 15], [Hart and Nisan 13]), 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 ([Briest et. al 15], [Hart and Nisan 13]) 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.


page 1

page 2

page 3

page 4


Robust Revenue Maximization Under Minimal Statistical Information

We study the problem of multi-dimensional revenue maximization when sell...

On Infinite Separations Between Simple and Optimal Mechanisms

We consider a revenue-maximizing seller with k heterogeneous items for s...

On Simple Mechanisms for Dependent Items

We study the problem of selling n heterogeneous items to a single buyer,...

Price of Anarchy of Simple Auctions with Interdependent Values

We expand the literature on the price of anarchy (PoA) of simultaneous i...

Prophet Inequalities with Linear Correlations and Augmentations

In a classical online decision problem, a decision-maker who is trying t...

Multi-Item Mechanisms without Item-Independence: Learnability via Robustness

We study the sample complexity of learning revenue-optimal multi-item au...

Optimal Correlated Rounding for Multi-item Orders in E-commerce Fulfillment

We study the dynamic fulfillment problem in e-commerce, in which incomin...