Linear Program-Based Approximation for Personalized Reserve Prices
<jats:p> We study the problem of computing data-driven personalized reserve prices in eager second price auctions without having any assumption on valuation distributions. Here, the input is a data set that contains the submitted bids of n buyers in a set of auctions, and the problem is to ret...
Main Authors: | Derakhshan, Mahsa, Golrezaei, Negin, Paes Leme, Renato |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | English |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2022
|
Online Access: | https://hdl.handle.net/1721.1/144168 |
Similar Items
-
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms
by: Beyhaghi, Hedyeh, et al.
Published: (2022) -
Auction Design for ROI-Constrained Buyers
by: Golrezaei, Negin, et al.
Published: (2022) -
Product Ranking on Online Platforms
by: Derakhshan, Mahsa, et al.
Published: (2022) -
Dynamic Pricing for Heterogeneous Time-Sensitive Customers
by: Golrezaei, Negin, et al.
Published: (2021) -
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions
by: Golrezaei, Negin, et al.
Published: (2021)