Skip to main content

Bayesian Mechanism Design with Efficiency, Privacy, and Approximate Truthfulness

  • Conference paper
Internet and Network Economics (WINE 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7695))

Included in the following conference series:


Recently, there has been a number of papers relating mechanism design and privacy (e.g., see [1-6]). All of these papers consider a worst-case setting where there is no probabilistic information about the players’ types. In this paper, we investigate mechanism design and privacy in the Bayesian setting, where the players’ types are drawn from some common distribution. We adapt the notion of differential privacy to the Bayesian mechanism design setting, obtaining Bayesian differential privacy. We also define a robust notion of approximate truthfulness for Bayesian mechanisms, which we call persistent approximate truthfulness. We give several classes of mechanisms (e.g., social welfare mechanisms and histogram mechanisms) that achieve both Bayesian differential privacy and persistent approximate truthfulness. These classes of mechanisms can achieve optimal (economic) efficiency, and do not use any payments. We also demonstrate that by considering the above mechanisms in a modified mechanism design model, the above mechanisms can achieve actual truthfulness.

Work supported in part by NSF grants IIS-0534064, IIS-0812045, IIS-0911036, CCF-0746990; AFOSR grants FA9550-08-1-0438, FA9550-09-1-0266, FA9550-10-1-0093; ARO grant W911NF-09-1-0281. We thank Joseph Y. Halpern for helpful discussions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS, pp. 94–103 (2007)

    Google Scholar 

  2. Xiao, D.: Is privacy compatible with truthfulness? IACR ePrint (2011)

    Google Scholar 

  3. Chen, Y., Chong, S., Kash, I.A., Moran, T., Vadhan, S.P.: Truthful mechanisms for agents that value privacy (2011) (manuscript)

    Google Scholar 

  4. Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. In: ITCS, pp. 203–213 (2012)

    Google Scholar 

  5. Nissim, K., Orlandi, C., Smorodinsky, R.: Privacy-aware mechanism design. In: EC, pp. 774–789 (2012)

    Google Scholar 

  6. Huang, Z., Kannan, S.: The exponential mechanism for social welfare: Private, truthful, and nearly optimal. In: FOCS (2012)

    Google Scholar 

  7. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating Noise to Sensitivity in Private Data Analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265–284. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Dwork, C.: Differential Privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Fudenberg, D., Tirole, J.: Game Theory. MIT Press (1991)

    Google Scholar 

  10. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press (2007)

    Google Scholar 

  11. Shoham, Y., Leyton-Brown, K.: Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press (2009)

    Google Scholar 

  12. Tijs, S.H.: Nash equilibria for noncooperative n-person games in normal form. SIAM Review 23(2), 225–237 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Abraham, I., Dolev, D., Halpern, J., Gonen, R.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In: PODC, pp. 53–62 (2006)

    Google Scholar 

  14. Halpern, J.Y.: Beyond nash equilibrium: solution concepts for the 21st century. In: PODC (2008)

    Google Scholar 

  15. Halpern, J., Pass, R.: Game theory with costly computation: Formulation and application to protocol security. In: ICS, pp. 120–142 (2010)

    Google Scholar 

  16. Birrell, E., Pass, R.: Approximately strategy-proof voting. In: IJCAI, pp. 67–72 (2011)

    Google Scholar 

  17. Kothari, A., Parkes, D.C., Suri, S.: Approximately-strategyproof and tractable multi-unit auctions (2004)

    Google Scholar 

  18. Schummer, J.: Almost-dominant strategy implementation: exchange economies. Games and Economic Behavior 48(1), 154–170 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Bhaskar, R., Bhowmick, A., Goyal, V., Laxman, S., Thakurta, A.: Noiseless Database Privacy. In: Lee, D.H. (ed.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 215–232. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leung, S., Lui, E. (2012). Bayesian Mechanism Design with Efficiency, Privacy, and Approximate Truthfulness. In: Goldberg, P.W. (eds) Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol 7695. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35310-9

  • Online ISBN: 978-3-642-35311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics