LP-based Approximation for Personalized Reserve Prices

05/04/2019
by   Mahsa Derakhshan, et al.
0

We study the problem of computing revenue-optimal personalize (non-anonymous) reserve prices in eager second price auction in a single-item environment 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 ṟ that maximize the revenue earned on these auctions by running eager second price auctions with reserve ṟ. We present a novel LP formulation to this problem and a rounding procedure which achievesOur main result in a polynomial-time LP-based algorithm that achieves a (1+2(√(2)-1)e^√(2)-2)^-1≈-approximation. This improves over the 12-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.and obtains the best known approximation ratio even for the special case of independent distributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2020

Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions

We study the problem of finding personalized reserve prices for unit-dem...
research
05/24/2023

Trading Prophets

In this work we initiate the study of buy-and-sell prophet inequalities....
research
07/10/2018

Improved Approximations for Free-Order Prophets and Second-Price Auctions

We study the fundamental problem of selling a single indivisible item to...
research
05/10/2023

Constant Approximation for Network Revenue Management with Markovian-Correlated Customer Arrivals

The Network Revenue Management (NRM) problem is a well-known challenge i...
research
05/18/2016

Optimization Beyond Prediction: Prescriptive Price Optimization

This paper addresses a novel data science problem, prescriptive price op...
research
06/08/2021

Learning to Price Against a Moving Target

In the Learning to Price setting, a seller posts prices over time with t...
research
01/15/2018

Approximating the Incremental Knapsack Problem

We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacit...

Please sign up or login with your details

Forgot password? Click here to reset