Private Mechanism Design via Quantile Estimation

Published: 22 Jan 2025, Last Modified: 29 Apr 2025ICLR 2025 PosterEveryoneRevisionsBibTeXCC BY 4.0
Keywords: online auctions, differential privacy, mechanism design
TL;DR: we demonstrate how to efficiently learn a near-optimal mechanism with pure privacy from sample data for the single item setting. We further apply this mechanism to online settings involving non-myopic and strategic bidders.
Abstract:

We investigate the problem of designing differentially private (DP), revenue-maximizing single item auction. Specifically, we consider broadly applicable settings in mechanism design where agents' valuation distributions are independent, non-identical, and can be either bounded or unbounded. Our goal is to design such auctions with pure, i.e., $(\epsilon,0)$ privacy in polynomial time.

In this paper, we propose two computationally efficient auction learning framework that achieves pure privacy under bounded and unbounded distribution settings. These frameworks reduces the problem of privately releasing a revenue-maximizing auction to the private estimation of pre-specified quantiles. Our solutions increase the running time by polylog factors compared to the non-private version. As an application, we show how to extend our results to the multi-round online auction setting with non-myopic bidders. To our best knowledge, this paper is the first to efficiently deliver a Myerson auction with pure privacy and near-optimal revenue, and the first to provide such auctions for unbounded distributions.

Supplementary Material: pdf
Primary Area: optimization
Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.
Submission Number: 2239
Loading