The DOI matches its OpenAlex record.
Mechanism Design via Differential Privacy
Abstract
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic agents, which must encourage players to honestly report information. Specifically, we show that the recent notion of differential privacv, in addition to its own intrinsic virtue, can ensure that participants have limited effect on the outcome of the mechanism, and as a consequence have limited incentive to lie. More precisely, mechanisms with differential privacy are approximate dominant strategy under arbitrary player utility functions, are automatically resilient to coalitions, and easily allow repeatability. We study several special cases of the unlimited supply auction problem, providing new results for digital goods auctions, attribute auctions, and auctions with arbitrary structural constraints on the prices. As an important prelude to developing a privacy-preserving auction mechanism, we introduce and study a generalization of previous privacy work that accommodates the high sensitivity of the auction setting, where a single participant may dramatically alter the optimal fixed price, and a slight change in the offered price may take the revenue from optimal to zero.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Broadening the Scope of Differential Privacy Using Metrics
Chatzikokolakis, K., Andrés, M. E., Bordenabe, N. E., & Palamidessi, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39077-7_5 · Cited by 340
Differential Privacy for Statistics: What we Know and What we Want to Learn
Dwork, C., & Smith, A. (2010) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i2.570 · Cited by 264
Learning in a Large Function Space: Privacy-Preserving Mechanisms for SVM Learning
Rubinstein, B. I. P., Bartlett, P. L., Huang, L., & Taft, N. (2012) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v4i1.612 · Cited by 262
How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacy
Ponomareva, N., Hazimeh, H., Kurakin, A., Xu, Z., Denison, C., McMahan, H. B., Vassilvitskii, S., Chien, S., & Thakurta, A. G. (2023) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.14649 · Cited by 166
Enhancing data utility in differential privacy via microaggregation-based $$k$$ k -anonymity
Soria-Comas, J., Domingo-Ferrer, J., Sánchez, D., & Martínez, S. (2014) · The VLDB Journal · doi:10.1007/s00778-014-0351-4 · Cited by 149
Metadata
- Authors
- McSherry, F., & Talwar, K.
- Venue
- Annual Symposium on Foundations of Computer Science
- Publisher
- Institute of Electrical and Electronics Engineers
- Published
- 2007-10-01
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W4234281613
- Cited by
- 202
- References
- 0
- FWCI
- 1.49
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Mechanism Design via Differential Privacy. https://app.cochat.ai/papers/10.1109/focs.2007.4389483
- The paper
- McSherry, F., & Talwar, K. (2007). Mechanism Design via Differential Privacy. Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/focs.2007.4389483
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.