Revenue maximization with a single sample

By Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan. ACM Conference on Economics and Computation, 2010

305 citations recorded by the source corpus.

Subfields: Management Information Systems, Management Science and Operations Research, Marketing

View Paper: https://www.semanticscholar.org/paper/ec5c3681bf2c0a02925a3a15b016bead279bcab1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Management Information Systems

1. Tim Roughgarden
2. S. Matthew Weinberg
3. Pablo D. Azar
4. Robert D. Kleinberg
5. É. Tardos

In Management Science and Operations Research

1. Pablo D. Azar
2. S. Matthew Weinberg
3. Robert D. Kleinberg
4. Richard J. Cole
5. Tim Roughgarden
6. Aleksandrs Slivkins
7. É. Tardos
8. Thorsten Joachims

In Marketing

1. Pablo D. Azar
2. S. Matthew Weinberg
3. Robert D. Kleinberg
4. Richard J. Cole
5. Tim Roughgarden
6. Sergei Vassilvitskii
7. Thodoris Lykouris

Citations in the corpus

• The sample complexity of revenue maximization (2014, background): “The only other paper we are aware of that proves, as we do, sample complexity bounds that apply uniformly to all distributions (subject to a tail condition) is [8].”
• Prophet Inequalities with Limited Information (2013, methodology): “…the well know fact that the Vickrey Clarke Groves (VCG) auction with appropriate reserves is approximately optimal for matroid environments [14, 11] to show that any mechanism that approximately maximizes welfare (not necessarily VCG) also approximately maximizes revenue when valuations are…”