Regret Minimization for Reserve Prices in Second-Price Auctions

We show a regret minimization algorithm for setting the reserve price in a sequence of second-price auctions, under the assumption that all bids are independently drawn from the same unknown and arbitrary distribution. Our algorithm is computationally efficient, and achieves a regret of Õ(√T) in a sequence of T auctions. This holds even when the number of bidders is stochastic with a known distribution.

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

[2]  P. Massart.  The Tight Constant in the Dvoretzky-Kiefer-Wolfowitz Inequality , 1990 .

[3]  D. Pollard.  Empirical Processes: Theory and Applications , 1990 .

[4]  Jon A. Wellner,et al.  Weak Convergence and Empirical Processes: With Applications to Statistics , 1996 .

[5]  Susan Athey,et al.  Identification of Standard Auction Models , 2000 .

[6]  Philip A. Haile,et al.  Inference with an Incomplete Model of English Auctions , 2000, Journal of Political Economy.

[7]  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..

[8]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[9]  Kevin Leyton-Brown,et al.  Bidding agents for online auctions with hidden bids , 2007, Machine Learning.

[10]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[11]  Tim Roughgarden,et al.  Algorithmic game theory , 2010, Commun. ACM.

[12]  N. Nisan.  Introduction to Mechanism Design (for Computer Scientists) , 2007 .

[13]  Peter Auer,et al.  Improved Rates for the Stochastic Continuum-Armed Bandit Problem , 2007, COLT.

[14]  Optimal design of english auctions with discrete bid levels , 2007, TOIT.

[15]  Craig Boutilier,et al.  Computing Reserve Prices and Identifying the Value Distribution in Real-world Auctions with Market Disruptions , 2008, AAAI.

[16]  Eric W. Cope,et al.  Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems , 2009, IEEE Transactions on Automatic Control.

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

[18]  Anna R. Karlin,et al.  Profit maximization in mechanism design: beyond the bayesian approach , 2011 .

[19]  Csaba Szepesvári,et al.  –armed Bandits , 2022 .

[20]  Shie Mannor,et al.  Unimodal Bandits , 2011, ICML.

[21]  Michael Ostrovsky,et al.  Reserve Prices in Internet Advertising Auctions: A Field Experiment , 2009, Journal of Political Economy.