Posting Prices with Unknown Distributions

We consider a dynamic auction model, where bidders sequentially arrive to the market. The values of the bidders for the item for sale are independently drawn from a distribution, but this distribution is unknown to the seller. The seller offers a personalized take-it-or-leave-it price for each arriving bidder and aims to maximize revenue. We study how well can such sequential posted-price mechanisms approximate the optimal revenue that would be achieved if the distribution was known to the seller. On the negative side, we show that sequential posted-price mechanisms cannot guarantee a constant fraction of this revenue when the class of candidate distributions is unrestricted. We show that this impossibility holds even for randomized mechanisms and even if the set of possible distributions is very small or when the seller has a prior distribution over the candidate distributions. On the positive side, we devise a simple posted-price mechanism that guarantees a constant fraction of the known-distribution revenue when all candidate distributions exhibit the monotone hazard rate property.

[1]  Ilya Segal,et al.  Optimal Pricing Mechanisms with Unknown Demand , 2002 .

[2]  Mohammad Taghi Hajiaghayi,et al.  Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.

[3]  Benny Moldovanu,et al.  Optimal search, learning and implementation , 2012, J. Econ. Theory.

[4]  A. W. Marshall,et al.  Bounds for Distributions with Monotone Hazard Rate, II , 1964 .

[5]  S. Matthew Weinberg,et al.  Matroid prophet inequalities , 2012, STOC '12.

[6]  Robert B. Wilson Efficient and Competitive Rationing , 1989 .

[7]  Noam Nisan,et al.  Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.

[8]  E. Samuel-Cahn Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .

[9]  Noam Nisan,et al.  Auctions with Severely Bounded Communication , 2007, J. Artif. Intell. Res..

[10]  Sudipto Guha,et al.  Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions , 2010, WINE.

[11]  Anna R. Karlin,et al.  Competitive auctions , 2006, Games Econ. Behav..

[12]  Alex Gershkov,et al.  Learning about the Future and Dynamic Efficiency , 2009 .

[13]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[14]  Shuchi Chawla,et al.  Algorithmic pricing via virtual valuations , 2007, EC '07.

[15]  Tim Roughgarden,et al.  Revenue maximization with a single sample , 2010, EC '10.

[16]  Anna R. Karlin,et al.  On profit maximization in mechanism design , 2007 .

[17]  Shuchi Chawla,et al.  Sequential Posted Pricing and Multi-parameter Mechanism Design , 2010, ArXiv.

[18]  M. Rothschild,et al.  Searching for the Lowest Price When the Distribution of Prices Is Unknown , 1974, Journal of Political Economy.

[19]  Jason D. Hartline,et al.  Multi-parameter mechanism design and sequential posted pricing , 2009, STOC '10.

[20]  Frank Thomson Leighton,et al.  The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[21]  ConitzerVincent,et al.  The ACM transactions on economics and computation , 2013 .

[22]  Jeremy I. Bulow,et al.  Auctions versus Negotiations , 1996 .

[23]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[24]  Michael Dinitz,et al.  Secretary problems: weights and discounts , 2009, SODA.

[25]  Liad Blumrosen,et al.  Posted prices vs. negotiations: an asymptotic analysis , 2008, EC '08.

[26]  Ruqu Wang,et al.  Learning buyers' valuation distribution in posted-price selling , 1999 .

[27]  Tim Roughgarden,et al.  Optimal mechanism design and money burning , 2008, STOC.

[28]  Nicole Immorlica,et al.  A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.