The Sample Complexity of Auctions with Side Information
Nikhil R. Devanur, Zhiyi Huang, Christos-Alexandros Psomas

TL;DR
This paper studies the sample complexity of designing Bayesian optimal auctions when bidders are indistinguishable a priori but can be differentiated using side information, extending previous models to more realistic scenarios.
Contribution
It introduces a new model for auction design with side information and extends existing sample complexity bounds to this setting, including a revenue monotonicity lemma.
Findings
Derived almost matching upper and lower bounds for sample complexity.
Extended the sample complexity approach to auctions with side information.
Improved bounds using Empirical Risk Minimization techniques.
Abstract
Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d., or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when the bidders can be classified into a few categories, but there are many instances where the classification of bidders is a continuum. For example, the classification of the bidders may be based on their annual income, their propensity to buy an item based on past behavior, or in the case of ad auctions, the click through rate of their ads. We introduce an alternate model that captures this aspect, where bidders are \emph{a priori} identical, but can be distinguished based (only) on some side information the auctioneer obtains at the time of the auction. We extend the sample complexity approach of Dhangwatnotai, Roughgarden, and Yan (2014) and Cole…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Consumer Market Behavior and Pricing · Imbalanced Data Classification Techniques
