Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1007/978-3-030-94676-0_5guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Welfare-Preserving ε-BIC to BIC Transformation with Negligible Revenue Loss

Published: 14 December 2021 Publication History

Abstract

In this paper, we provide a transform from an ε-BIC mechanism into an exactly BIC mechanism without any loss of social welfare and with additive and negligible revenue loss. This is the first ε-BIC to BIC transformation that preserves welfare and provides negligible revenue loss. The revenue loss bound is tight given the requirement to maintain social welfare. Previous ε-BIC to BIC transformations preserve social welfare but have no revenue guarantee [4], or suffer welfare loss while incurring a revenue loss with both a multiplicative and an additive term, e.g., [9, 14, 28]. The revenue loss achieved by our transformation is incomparable to these earlier approaches and can be significantly less. Our approach is different from the previous replica-surrogate matching methods and we directly make use of a directed and weighted type graph (induced by the types’ regret), one for each agent. The transformation runs a fractional rotation step and a payment reducing step iteratively to make the mechanism Bayesian incentive compatible. We also analyze ε-expected ex-post IC (ε-EEIC) mechanisms [18]. We provide a welfare-preserving transformation in this setting with the same revenue loss guarantee for uniform type distributions and give an impossibility result for non-uniform distributions. We apply the transform to linear-programming based and machine-learning based methods of automated mechanism design.

References

[1]
Azevedo EM and Budish E Strategy-proofness in the Large Rev. Econ. Stud. 2019 86 1 81-116
[2]
Balcan, M., Sandholm, T., Vitercik, E.: Estimating approximate incentive compatibility. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, 867p (2019)
[3]
Balseiro SR, Feldman J, Mirrokni V, and Muthukrishnan S Yield optimization of display advertising with ad exchange Manage. Sci. 2014 60 12 2886-2907
[4]
Bei, X., Huang, Z.: Bayesian incentive compatibility via fractional assignments. In: Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 720–733 (2011)
[5]
Border KC Implementation of reduced form auctions: a geometric approach Econometrica 1991 59 4 1175-1187
[6]
Cai, Y., Daskalakis, C., Weinberg, M.S.: Optimal multi-dimensional mechanism design: reducing revenue to welfare maximization. In: Proceedings of the 53rd IEEE Symposium on Foundations of Computer Science, pp. 130–139 (2012)
[7]
Cai, Y., Daskalakis, C., Weinberg, S.M.: An algorithmic characterization of multi-dimensional mechanisms. In: Proceedings of the 44th ACM Symposium on Theory of Computing (2012)
[8]
Cai, Y., Daskalakis, C., Weinberg, S.M.: Understanding incentives: mechanism design becomes algorithm design. In: Proceedings of the 54th IEEE Symposium on Foundations of Computer Science, pp. 618–627 (2013)
[9]
Cai, Y., Oikonomou, A., Velegkas, G., Zhao, M.: An efficient ε-BIC to BIC transformation and its application to black-box reduction in revenue maximization. In: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2021)
[10]
Cai, Y., Zhao, M.: Simple mechanisms for subadditive buyers via duality. In: Proceedings of the 49th ACM Symposium on Theory of Computing, pp. 170–183 (2017)
[11]
Carroll G When are local incentive constraints sufficient? Econometrica 2012 80 2 661-686
[12]
Conitzer, V., Sandholm, T.: Complexity of mechanism design. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, pp. 103–110 (2002)
[13]
Conitzer, V., Sandholm, T.: Self-interested automated mechanism design and implications for optimal combinatorial auctions. In: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 132–141 (2004)
[14]
Daskalakis, C., Weinberg, S.M.: Symmetries and optimal multi-dimensional mechanism design. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 370–387 (2012)
[15]
Diakonikolas I, Papadimitriou C, Pierrakos G, and Singer Y Czumaj A, Mehlhorn K, Pitts A, and Wattenhofer R Efficiency-revenue trade-offs in auctions Automata, Languages, and Programming 2012 Heidelberg Springer 488-499
[16]
Duetting, P., Feng, Z., Narasimhan, H., Parkes, D., Ravindranath, S.S.: Optimal auctions through deep learning. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97. PMLR, Long Beach, California, USA, 9–15 June 2019
[17]
Dughmi, S., Hartline, J.D., Kleinberg, R., Niazadeh, R.: Bernoulli factories and black-box reductions in mechanism design. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (2017)
[18]
Dütting P, Fischer F, Jirapinyo P, Lai J, Lubin B, and Parkes DC Payment rules through discriminant-based classifiers ACM Trans. Econ. Comput. 2014 3 1 5
[19]
Feng, Z., Narasimhan, H., Parkes, D.C.: Deep learning for revenue-optimal auctions with budgets. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems, pp. 354–362 (2018)
[20]
Feng, Z., Schrijvers, O., Sodomka, E.: Online learning for measuring incentive compatibility in ad auctions. In: The World Wide Web Conference, WWW 2019, pp. 2729–2735 (2019)
[21]
Hartline, J.D., Kleinberg, R., Malekian, A.: Bayesian incentive compatibility via matchings. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011)
[22]
Hartline, J.D., Lucier, B.: Bayesian algorithmic mechanism design. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing (2010)
[23]
Hashimoto T The generalized random priority mechanism with budgets J. Econ. Theory 2018 177 708-733
[24]
Lahaie, S., Medina, A.M., Sivan, B., Vassilvitskii, S.: Testing incentive compatibility in display ad auctions. In: Proceedings of the 27th International World Wide Web Conference (WWW) (2018)
[25]
Lahaie, S., Pennock, D.M.: Revenue analysis of a family of ranking rules for keyword auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC), pp. 50–56 (2007)
[26]
Lubin B and Parkes DC Approximate strategyproofness Curr. Sci. 2012 103 9 1021-1032
[27]
Narasimhan, H., Parkes, D.C.: A general statistical framework for designing strategy-proof assignment mechanisms. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence (2016)
[28]
Rubinstein A and Weinberg MS Simple mechanisms for a subadditive buyer and applications to revenue monotonicity ACM Trans. Econ. Comput. 2018 6 1-25

Cited By

View all
  • (2024)Optimal Auctions through Deep Learning: Advances in Differentiable EconomicsJournal of the ACM10.1145/363074971:1(1-53)Online publication date: 11-Feb-2024

Index Terms

  1. Welfare-Preserving ε-BIC to BIC Transformation with Negligible Revenue Loss
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      Web and Internet Economics: 17th International Conference, WINE 2021, Potsdam, Germany, December 14–17, 2021, Proceedings
      Dec 2021
      562 pages
      ISBN:978-3-030-94675-3
      DOI:10.1007/978-3-030-94676-0
      • Editors:
      • Michal Feldman,
      • Hu Fu,
      • Inbal Talgam-Cohen

      Publisher

      Springer-Verlag

      Berlin, Heidelberg

      Publication History

      Published: 14 December 2021

      Author Tags

      1. BIC transformation
      2. Automated mechanism design
      3. Approximately IC mechanism

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 07 Mar 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Optimal Auctions through Deep Learning: Advances in Differentiable EconomicsJournal of the ACM10.1145/363074971:1(1-53)Online publication date: 11-Feb-2024

      View Options

      View options

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media