Name
Abstract | ||
|---|---|---|
We study the problem of computing personalized reserve prices in eager second price auctions without having any assumption on valuation distributions. Here, the input is a dataset that contains the submitted bids of n buyers in a set of auctions and the goal is to return personalized reserve prices r that maximize the revenue earned on these auctions by running eager second price auctions with reserve r. We present a novel LP formulation to this problem and a rounding procedure which achieves a (1+2(√2-1)e√2-2)-1≅0.684-approximation. This improves over the 1/2-approximation Algorithm due to Roughgarden and Wang. We show that our analysis is tight for this rounding procedure. We also bound the integrality gap of the LP, which bounds the performance of any algorithm based on this LP.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3328526.3329594 | Proceedings of the 2019 ACM Conference on Economics and Computation |
Keywords | Field | DocType |
algorithm design, approximation algorithms | Mathematical optimization,Computer science | Journal |
Volume | ISBN | Citations |
abs/1905.01526 | 978-1-4503-6792-9 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mahsa Derakhshan | 1 | 11 | 7.65 |
| Negin Golrezaei | 2 | 861 | 42.78 |
| renato paes | 3 | 331 | 36.45 |