Auctioning with Strategically Reticent Bidders
Jibang Wu, Ashwinkumar Badanidiyuru, Haifeng Xu

TL;DR
This paper introduces a new auction mechanism design for bidders who can misreport their type but choose to conceal or partially reveal their private information, ensuring incentive and information compatibility.
Contribution
It develops two black-box transformations that adapt classic mechanisms to strategically reticent bidders, maintaining incentive and information compatibility.
Findings
VCG with expected values maximizes welfare
Expected outcome of Myerson's auction maximizes revenue
Regulation can enhance mechanism robustness
Abstract
We propose and study a novel mechanism design setup where each bidder holds two kinds of private information: (1) type variable, which can be misreported; (2) information variable, which the bidder may want to conceal or partially reveal, but importantly, not to misreport. We refer to bidders with such behaviors as strategically reticent bidders. Among others, one direct motivation of our model is the ad auction in which many ad platforms today elicit from each bidder not only their private value per conversion but also their private information about Internet users (e.g., user activities on the advertiser's websites) in order to improve the platform's estimation of conversion rates. We show that in this new setup, it is still possible to design mechanisms that are both Incentive and Information Compatible (IIC). We develop two different black-box transformations, which convert any…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Experimental Behavioral Economics Studies · Consumer Market Behavior and Pricing
