Welfare-Preserving $\varepsilon$-BIC to BIC Transformation with Negligible Revenue Loss

In this paper, we investigate the problem of transforming an $\varepsilon$-BIC mechanism into an exactly BIC mechanism without loss of social welfare, working in a general mechanism design setting. We can transform any $\varepsilon$-BIC mechanism to a BIC mechanism with no loss of social welfare and with additive and negligible revenue loss. We show that the revenue loss bound is tight given the requirement to maintain social welfare. This is the first $\varepsilon$-BIC to BIC transformation that preserves welfare and provides negligible revenue loss. Previous $\varepsilon$-BIC to BIC transformations preserve social welfare but have no revenue guarantee~\citep{BeiHuang11}, or suffer welfare loss while incurring a revenue loss with both a multiplicative and an additive term, e.g.,~\citet{DasWeinberg12, CaiZhao17, Rubinstein18}. The revenue loss achieved by our transformation is incomparable to these earlier approaches and can sometimes be significantly less. We also analyze $\varepsilon$-expected ex-post IC ($\varepsilon$-EEIC) mechanisms~\citep{DuettingFJLLP12}, and provide a welfare-preserving transformation with the same revenue loss guarantee for the special case of uniform type distributions. We give applications of our methods to both linear-programming based and machine-learning based methods of automated mechanism design. We also show the impossibility of welfare-preserving, $\varepsilon$-EEIC to BIC transformations with negligible loss of revenue for non-uniform distributions.

[1]  Eric Budish,et al.  Strategy-Proofness in the Large , 2017, The Review of Economic Studies.

[2]  Yang Cai,et al.  An Efficient $\varepsilon$-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization , 2019 .

[3]  Robert D. Kleinberg,et al.  Bayesian incentive compatibility via matchings , 2011, SODA '11.

[4]  Kim C. Border IMPLEMENTATION OF REDUCED FORM AUCTIONS: A GEOMETRIC APPROACH , 1991 .

[5]  S. Matthew Weinberg,et al.  Symmetries and optimal multi-dimensional mechanism design , 2012, EC '12.

[6]  Sergei Vassilvitskii,et al.  Testing Incentive Compatibility in Display Ad Auctions , 2018, WWW.

[7]  S. Matthew Weinberg,et al.  Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity , 2018, ACM Trans. Economics and Comput..

[8]  Shuchi Chawla,et al.  Bayesian algorithmic mechanism design , 2014, SECO.

[9]  Tadashi Hashimoto,et al.  The Generalized Random Priority Mechanism with Budgets , 2016, J. Econ. Theory.

[10]  Paul Dütting,et al.  Optimal auctions through deep learning , 2017, ICML.

[11]  Yang Cai,et al.  An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization , 2021, SODA.

[12]  Zhe Feng,et al.  Online Learning for Measuring Incentive Compatibility in Ad Auctions? , 2019, WWW.

[13]  David M. Pennock,et al.  Revenue analysis of a family of ranking rules for keyword auctions , 2007, EC '07.

[14]  Paul Dütting,et al.  Payment Rules through Discriminant-Based Classifiers , 2012, ACM Trans. Economics and Comput..

[15]  David C. Parkes,et al.  Deep Learning for Revenue-Optimal Auctions with Budgets , 2018, AAMAS.

[16]  Yang Cai,et al.  Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[17]  David C. Parkes,et al.  A General Statistical Framework for Designing Strategy-proof Assignment Mechanisms , 2016, UAI.

[18]  Andrew Chi-Chih Yao,et al.  Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison , 2017, EC.

[19]  Shaddin Dughmi,et al.  Bernoulli factories and black-box reductions in mechanism design , 2017, SECO.

[20]  Yang Cai,et al.  Simple mechanisms for subadditive buyers via duality , 2016, STOC.

[21]  Christos H. Papadimitriou,et al.  Efficiency-Revenue Trade-Offs in Auctions , 2012, ICALP.

[22]  Gabriel D. Carroll When Are Local Incentive Constraints Sufficient , 2012 .

[23]  Maria-Florina Balcan,et al.  Estimating Approximate Incentive Compatibility , 2019, EC.

[24]  Jon Feldman,et al.  Yield optimization of display advertising with ad exchange , 2011, EC '11.

[25]  Xiaohui Bei,et al.  Bayesian incentive compatibility via fractional assignments , 2010, SODA '11.

[26]  David C. Parkes,et al.  Approximate Strategyproofness , 2012 .

[27]  Yang Cai,et al.  Understanding Incentives: Mechanism Design Becomes Algorithm Design , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[28]  Vincent Conitzer,et al.  Self-interested automated mechanism design and implications for optimal combinatorial auctions , 2004, EC '04.

[29]  Vincent Conitzer,et al.  Complexity of Mechanism Design , 2002, UAI.