Online Auction Design Using Distribution-Free Uncertainty Quantification with Applications to E-Commerce
Not on the map. Why?
Abstract (arXiv)
Online auction is a cornerstone of e-commerce, and a key challenge is designing incentive-compatible mechanisms that maximize expected revenue. Existing approaches often assume known bidder value distributions and fixed sets of bidders and items, but these assumptions rarely hold in real-world settings where bidder values are unknown, and the number of future participants is uncertain. In this paper, we introduce the Conformal Online Auction Design (COAD), a novel mechanism that maximizes revenue by quantifying uncertainty in bidder values without relying on known distributions. COAD incorporates both bidder and item features, using historical data to design an incentive-compatible mechanism for online auctions. Unlike traditional methods, COAD leverages distribution-free uncertainty quantification techniques and integrates machine learning methods, such as random forests, kernel methods, and deep neural networks, to predict bidder values while ensuring revenue guarantees. Moreover, COAD introduces bidder-specific reserve prices, based on the lower confidence bounds of bidder valuations, contrasting with the single reserve prices commonly used in the literature. We demonstrate the practical effectiveness of COAD through an application to real-world eBay auction data. Theoretical results and extensive simulation studies further validate the properties of our approach.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 49 references that are in the map. First posted on arXiv 11 May 2024.
Builds on
16 of 49 references.
References · 16
- 2016Distribution-Free Predictive Inference For Regressioncited by 657
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 597
- 2021Adaptive Conformal Inference Under Distribution Shiftcited by 360
- 2023Conformal Prediction With Conditional Guaranteescited by 146
- 2018Budget Constrained Bidding by Model-free Reinforcement Learning in Display Advertisingcited by 60
- 2015The Sample Complexity of Revenue Maximizationcited by 48
- 2019Settling the Sample Complexity of Single-parameter Revenue Maximizationcited by 24
- 2019Multi-Item Mechanisms without Item-Independence: Learnability via Robustnesscited by 22
- 2015The Sample Complexity of Auctions with Side Informationcited by 20
- 2017Learning Multi-item Auctions with (or without) Samplescited by 18
- 2014Making the Most of Your Samplescited by 15
- 2020Learning Strategies in Decentralized Matching Markets under Uncertain Preferencescited by 14
4 more
- 2015Ironing in the Darkcited by 13
- 2021Learning in Multi-Stage Decentralized Matching Marketscited by 12
- 2022Incentive-Aware Recommender Systems in Two-Sided Marketscited by 5
- 2021Orthogonalized Kernel Debiased Machine Learning for Multimodal Data Analysiscited by 4
Built on by
Citing papers per year: 2025: 1.
1 paper.