On the Differential Private Data Market: Endogenous Evolution, Dynamic Pricing, and Incentive Compatibility

Privacy is an essential issue in data trading markets. This work uses a mechanism design approach to study the optimal market model to economize the value of privacy of personal data, using differential privacy. The buyer uses a finite number of randomized algorithms to get access to the owners’ data in a sequential-composition manner, in which each randomized algorithm is differentially private. Each usage of a randomized algorithm is referred to as a period. Motivated by the discovery of an individual’s dual motives for privacy protection, we partition each data owner’s preference over privacy protection into the intrinsic and the instrumental components, in which the instrumental preference arises endogenously from the data buyer’s sequential usages of multiple private algorithms. Due to the composability of differential privacy, there are inevitable privacy losses accumulated over periods. Hence, we allow the owners to leave the market at the end of any period by making stopping decisions. We define an instrumental kernel function to capture the instrumentalness of owners’ preferences and model the formation of each owner’s (both intrinsic and instrumental) preference over periods by taking into consideration of the composability of differential privacy and time-varying nature of privacy concerns. Our desideratum is to study the buyer’s design regime of optimal market models in dynamic environment when each owner makes coupled decisions of stopping and reporting of their preferences. The buyer seeks to design a privacy allocation rule that dynamically specifies the degree of privacy protections and a payment rule to compensate the privacy losses of the owners. The buyer additionally chooses a payment rule which is independent of owners’ report of their preferences to influence the owners’ stopping decisions. We characterize the dynamic incentive compatibility and provide a design principle to construct the payment rules in terms of the privacy allocation rule. Further, we relax the buyer’s market design problem and provide a sufficient condition for an approximated dynamic incentive compatible market model.

[1]  Jérémie Gallien,et al.  Sloan School of Management Working Paper 4268-02 December 2002 Dynamic Mechanism Design for Online Commerce , 2002 .

[2]  M. Dufwenberg Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[3]  Quanyan Zhu,et al.  On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment , 2019, Dyn. Games Appl..

[4]  Zhu Han,et al.  Economics of Internet of Things: an information market approach , 2016, IEEE Wireless Communications.

[5]  Z. John Zhang,et al.  Dynamic targeted pricing with strategic consumers , 2009 .

[6]  Aaron Roth,et al.  Conducting truthful surveys, cheaply , 2012, EC '12.

[7]  D. Bergemann,et al.  Selling Cookies , 2013 .

[8]  William P. Rogerson,et al.  THE FIRST-ORDER APPROACH TO PRINCIPAL-AGENT PROBLEMS , 1985 .

[9]  Yu-Han Lyu,et al.  Approximately optimal auctions for selling privacy when costs are correlated with data , 2012, EC '12.

[10]  Zhu Han,et al.  Market model and optimal pricing scheme of big data and Internet of Things (IoT) , 2016, 2016 IEEE International Conference on Communications (ICC).

[11]  Gintare Karolina Dziugaite,et al.  Entropy-SGD optimizes the prior of a PAC-Bayes bound: Data-dependent PAC-Bayes priors via differential privacy , 2017, NeurIPS.

[12]  Ian Goodfellow,et al.  Deep Learning with Differential Privacy , 2016, CCS.

[13]  Cynthia Dwork,et al.  Differential Privacy: A Survey of Results , 2008, TAMC.

[14]  Alex Gershkov,et al.  Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach , 2009 .

[15]  Andrew M. Odlyzko,et al.  Privacy, economics, and price discrimination on the Internet , 2003, ICEC '03.

[16]  Maher Said,et al.  Auctions with Dynamic Populations: Efficiency and Revenue Maximization , 2012, J. Econ. Theory.

[17]  Rakesh V. Vohra,et al.  Optimal Dynamic Auctions and Simple Index Rules , 2013, Math. Oper. Res..

[18]  Andreas Haeberlen,et al.  Differential Privacy: An Economic Method for Choosing Epsilon , 2014, 2014 IEEE 27th Computer Security Foundations Symposium.

[19]  Jianhua Li,et al.  Dynamic Privacy Pricing: A Multi-Armed Bandit Approach With Time-Variant Rewards , 2017, IEEE Transactions on Information Forensics and Security.

[20]  Michael R. Baye,et al.  Information Gatekeepers on the Internet and the Competitiveness of Homogeneous Product Markets , 2001 .

[21]  Curtis R. Taylor,et al.  The Economics of Privacy , 2016 .

[22]  Franklin Allen,et al.  The Market for information and the Origin of Financial Intermediation , 1990 .

[23]  Tesary Lin Valuing Intrinsic and Instrumental Preferences for Privacy , 2019, Mark. Sci..

[24]  Ravi Kumar,et al.  "I know what you did last summer": query logs and user privacy , 2007, CIKM '07.

[25]  Jason P. Mitchell,et al.  Disclosing information about the self is intrinsically rewarding , 2012, Proceedings of the National Academy of Sciences.

[26]  Paul R. Milgrom,et al.  Envelope Theorems for Arbitrary Choice Sets , 2002 .

[27]  Optimal Two-Sided Market Mechanism Design for Large-Scale Data Sharing and Trading in Massive IoT Networks , 2019, ArXiv.

[28]  H. Varian Economic Aspects of Personal Privacy , 2009 .

[29]  Moni Naor,et al.  Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.

[30]  Kenneth C. Laudon,et al.  Extensions to the Theory of Markets and Privacy: Mechanics of Pricing Information , 1997 .

[31]  G. Loewenstein,et al.  Privacy and human behavior in the age of information , 2015, Science.

[32]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[33]  I. Segal,et al.  Dynamic Mechanism Design: A Myersonian Approach , 2014 .

[34]  David C. Parkes,et al.  An MDP-Based Approach to Online Mechanism Design , 2003, NIPS.

[35]  P. Moerbeke On optimal stopping and free boundary problems , 1973, Advances in Applied Probability.

[36]  Anand D. Sarwate,et al.  Differentially Private Empirical Risk Minimization , 2009, J. Mach. Learn. Res..

[37]  Vincent Conitzer,et al.  Hide and Seek: Costly Consumer Privacy in a Market with Repeat Purchases , 2011, Mark. Sci..

[38]  Pramod Viswanath,et al.  The Composition Theorem for Differential Privacy , 2013, IEEE Transactions on Information Theory.

[39]  Aaron Roth,et al.  Take It or Leave It: Running a Survey When Privacy Comes at a Cost , 2012, WINE.

[40]  Ilya Segal,et al.  An Efficient Dynamic Mechanism , 2013 .

[41]  J. Robert,et al.  Incentive Compatible Contracts for the Sale of Information , 2002 .

[42]  David Xiao,et al.  Is privacy compatible with truthfulness? , 2013, ITCS '13.

[43]  Stratis Ioannidis,et al.  Privacy Auctions for Inner Product Disclosures , 2011, ArXiv.

[44]  J. Norris Appendix: probability and measure , 1997 .

[45]  Ronen Gradwohl,et al.  Voting in the limelight , 2017, EC.

[46]  Andrzej Skrzypacz,et al.  Revenue Management with Forward-Looking Buyers , 2016, Journal of Political Economy.

[47]  Dan Suciu,et al.  A theory of pricing private data , 2012, ICDT '13.

[48]  John M. Abowd,et al.  An Economic Analysis of Privacy Protection and Statistical Accuracy as Social Choices , 2018, American Economic Review.

[49]  S. Board,et al.  Competitive Information Disclosure in Search Markets , 2018, Journal of Political Economy.

[50]  Yongmin Chen,et al.  Paying Customers to Switch , 1997 .

[51]  Masayoshi Maruyama,et al.  Commitment to a strategy of uniform pricing in a two-period duopoly with switching costs , 2009 .

[52]  G. Stigler An Introduction to Privacy in Economics and Politics , 1980, The Journal of Legal Studies.

[53]  Richard A. Posner,et al.  Blackmail, Privacy, and Freedom of Contract , 1993 .

[54]  D. Bergemann,et al.  The Dynamic Pivot Mechanism , 2008 .

[55]  Aaron Roth,et al.  Selling privacy at auction , 2010, EC '11.

[56]  Ian A. Kash,et al.  Truthful mechanisms for agents that value privacy , 2011, EC.

[57]  Amin Saberi,et al.  Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising , 2013, Oper. Res..

[58]  D. Fudenberg,et al.  Customer Poaching and Brand Switching , 2000 .

[59]  Cynthia Dwork,et al.  Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography , 2007, WWW '07.

[60]  Quanyan Zhu,et al.  Dynamic Differential Privacy for ADMM-Based Distributed Classification Learning , 2017, IEEE Transactions on Information Forensics and Security.

[61]  Sham M. Kakade,et al.  Optimal Dynamic Mechanism Design and the Virtual Pivot Mechanism , 2013, Oper. Res..

[62]  Bernardo A. Huberman,et al.  A Market for Unbiased Private Data: Paying Individuals According to Their Privacy Attitudes , 2012, First Monday.

[63]  Thomas A. Weber,et al.  Efficient Dynamic Allocation with Uncertain Valuations , 2005 .

[64]  D. Blackwell Discounted Dynamic Programming , 1965 .

[65]  Bruno Jullien,et al.  Why Do Intermediaries Divert Search? , 2009 .

[66]  Kobbi Nissim,et al.  Privacy-aware mechanism design , 2011, EC '12.

[67]  Anat R. Admati,et al.  Selling and Trading on Information in Financial Markets , 1988 .

[68]  J. Rubenfeld The Right of Privacy , 1989 .

[69]  Luc Wathieu,et al.  Privacy, Exposure and Price Discrimination , 2003 .

[70]  Umar Syed,et al.  Learning Prices for Repeated Auctions with Strategic Buyers , 2013, NIPS.

[71]  Andreas Krause,et al.  Truthful incentives in crowdsourcing tasks using regret minimization mechanisms , 2013, WWW.

[72]  Péter Eso,et al.  Optimal Information Disclosure in Auctions and the Handicap Auction , 2007 .