scispace - formally typeset
Open AccessProceedings ArticleDOI

The sample complexity of revenue maximization

Reads0
Chats0
TLDR
In this article, the authors consider a single-item auction where bidders' valuations are drawn independently from unknown and non-identical distributions and the seller is given m samples from each of these distributions "for free" and chooses an auction to run on a fresh sample.
Abstract
In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior distribution over inputs. The most obvious source for such a distribution is past data. The goal of this paper is to understand how much data is necessary and sufficient to guarantee near-optimal expected revenue. Our basic model is a single-item auction in which bidders' valuations are drawn independently from unknown and nonidentical distributions. The seller is given m samples from each of these distributions "for free" and chooses an auction to run on a fresh sample. How large does m need to be, as a function of the number k of bidders and e 0, so that a (1 -- e)-approximation of the optimal revenue is achievable? We prove that, under standard tail conditions on the underlying distributions, m = poly(k, 1/e) samples are necessary and sufficient. Our lower bound stands in contrast to many recent results on simple and prior-independent auctions and fundamentally involves the interplay between bidder competition, non-identical distributions, and a very close (but still constant) approximation of the optimal revenue. It effectively shows that the only way to achieve a sufficiently good constant approximation of the optimal revenue is through a detailed understanding of bidders' valuation distributions. Our upper bound is constructive and applies in particular to a variant of the empirical Myerson auction, the natural auction that runs the revenue-maximizing auction with respect to the empirical distributions of the samples. To capture how our sample complexity upper bound depends on the set of allowable distributions, we introduce α-strongly regular distributions, which interpolate between the well-studied classes of regular (α = 0) and MHR (α = 1) distributions. We give evidence that this definition is of independent interest.

read more

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

The Sample Complexity of Revenue Maximization

TL;DR: It is shown that the only way to achieve a sufficiently good constant approximation of the optimal revenue is through a detailed understanding of bidders' valuation distributions, and introduces α-strongly regular distributions, which interpolate between the well-studied classes of regular and MHR distributions.
Posted Content

A Simple and Approximately Optimal Mechanism for an Additive Buyer

TL;DR: This work considers a monopolist seller with n heterogeneous items, facing a single buyer, and shows that for any distributions, the better of item and bundle pricing is a constant-factor approximation to the optimal revenue.
Posted Content

Competitive caching with machine learned advice.

TL;DR: This work develops a framework for augmenting online algorithms with a machine learned oracle to achieve competitive ratios that provably improve upon unconditional worst case lower bounds when the oracle has low error.
Book ChapterDOI

Online scheduling via learned weights

TL;DR: This work studies how predictive techniques can be used to break through worst case barriers in online scheduling, and gives algorithms that, equipped with predictions with error η, achieve O(log η (log logm) competitive ratios, breaking the Ω(logm) lower bound even for moderately accurate predictions.
Proceedings ArticleDOI

The sample complexity of auctions with side information

TL;DR: In this article, the sample complexity of the Bayesian optimal auction design problem is extended to the case where the bidders are a priori identical, but can be distinguished based on some side information the auctioneer obtains at the time of the auction.
References
More filters
Journal ArticleDOI

Optimal Auction Design

TL;DR: Optimal auctions are derived for a wide class of auction design problems when the seller has imperfect information about how much the buyers might be willing to pay for the object.
Proceedings ArticleDOI

A theory of the learnable

TL;DR: This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Book

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

TL;DR: Preface 1. Events and probability 2. Discrete random variables and expectation 3. Moments and deviations 4. Chernoff bounds 5. Balls, bins and random graphs 6. Probabilistic method 7. Markov chains and random walks 8. Continuous distributions and the Poisson process
Book

Neural Network Learning: Theoretical Foundations

TL;DR: The authors explain the role of scale-sensitive versions of the Vapnik Chervonenkis dimension in large margin classification, and in real prediction, and discuss the computational complexity of neural network learning.
Posted Content

Auctions Versus Negotiations

TL;DR: In this paper, the authors show that the auction is always preferable when bidders' signals are independent, under reasonable assumptions that the value of negotiating skill is small relative to value of additional competition.