Pricing with a Hidden Sample
Zhihao Gavin Tang, Yixin Tao, and Shixin Wang

TL;DR
This paper introduces hidden pricing mechanisms that use a single sample to implement robust, prior-independent pricing policies, bridging the gap between sample-based and statistic-based approaches in auction theory.
Contribution
It develops a framework for implementing concave pricing policies with a single hidden sample, providing performance guarantees and optimal mechanisms for certain distribution classes.
Findings
Achieves an approximation ratio of ~0.79 for MHR distributions.
Provides a reduction for analyzing monotone pricing policies.
Establishes impossibility results for general policies.
Abstract
We study prior-independent pricing for selling a single item to a single buyer when the seller observes only a single sample from the valuation distribution, while the buyer knows the distribution. Classical robust pricing approaches either rely on distributional statistics, which typically require many samples to estimate, or directly use revealed samples to determine prices and allocations. We show that these two regimes can be bridged by leveraging the buyer's informational advantage: pricing policies that conventionally require the seller to know statistics such as the mean, -norm, or superquantile can, in our framework, be implemented using only a single hidden sample. We introduce hidden pricing mechanisms, in which the seller commits ex ante to a pricing rule based on a single sample that is revealed only after the buyer's participation decision. We show that every…
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 · Game Theory and Voting Systems · Supply Chain and Inventory Management
