Applications of α-Strongly Regular Distributions to Bayesian Auctions

Two classes of distributions that are widely used in the analysis of Bayesian auctions are the monotone hazard rate (MHR) and regular distributions. They can both be characterized in terms of the rate of change of the associated virtual value functions: for MHR distributions, the condition is that for values v < v′, φ (v′) - φ (v) ≥ v′ - v, and for regular distributions, φ (v′) - φ (v) ≥ 0. Cole and Roughgarden introduced the interpolating class of α-strongly regular distributions (α-SR distributions for short), for which φ (v′) - φ (v) ≥ α (v′ - v), for 0 ≤ α ≤ 1. In this article, we investigate five distinct auction settings for which good expected revenue bounds are known when the bidders’ valuations are given by MHR distributions. In every case, we show that these bounds degrade gracefully when extended to α-SR distributions. For four of these settings, the auction mechanism requires knowledge of these distributions (in the remaining setting, the distributions are needed only to ensure good bounds on the expected revenue). In these cases, we also investigate what happens when the distributions are known only approximately via samples, specifically how to modify the mechanisms so that they remain effective and how the expected revenue depends on the number of samples.

[1]  Andrew Caplin,et al.  Aggregation and Imperfect Competition , 1991 .

[2]  Monika Henzinger,et al.  Limiting Price Discrimination when Selling Products with Positive Network Externalities , 2014, WINE.

[3]  Shuchi Chawla,et al.  Bayesian mechanism design for budget-constrained agents , 2011, EC '11.

[4]  Christian Ewerhart,et al.  Regular type distributions in mechanism design and $$\rho $$-concavity , 2013 .

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

[6]  Tim Roughgarden,et al.  Simple versus optimal mechanisms , 2009, EC '09.

[7]  Nikolaus Schweizer,et al.  The Quantitative View of Myerson Regularity , 2016, SSRN Electronic Journal.

[8]  Tim Roughgarden,et al.  Revenue maximization with a single sample , 2015, Games Econ. Behav..

[9]  Simon P. Anderson,et al.  Efficiency and surplus bounds in Cournot competition , 2003, J. Econ. Theory.

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

[11]  Andrew Caplin,et al.  Aggregation and Social Choice: A Mean Voter Theorem , 1991 .

[12]  Vahab S. Mirrokni,et al.  Optimal marketing strategies over social networks , 2008, WWW.

[13]  Gagan Goel,et al.  Efficiency of (revenue-)optimal mechanisms , 2009, EC '09.

[14]  Jason D. Hartline Mechanism Design and Approximation , 2014 .

[15]  Andrew Caplin,et al.  Aggregation and Imperfect Competition: On the Existence of Equilibrium , 1991 .

[16]  Gagan Goel,et al.  Budget-Constrained Auctions with Heterogeneous Items , 2012, Theory Comput..

[17]  Richard Cole,et al.  The sample complexity of revenue maximization , 2014, STOC.

[18]  Yang Yuan,et al.  On the ratio of revenue to welfare in single-parameter mechanism design , 2013, EC '13.

[19]  George Pierrakos,et al.  Simple, Optimal and Efficient Auctions , 2011, WINE.

[20]  S. Matthew Weinberg,et al.  Optimal and Efficient Parametric Auctions , 2013, SODA.