Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2492002.2482585acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article

Privacy and coordination: computing on databases with endogenous participation

Published: 16 June 2013 Publication History

Abstract

We propose a simple model where individuals in a privacy-sensitive population decide whether or not to participate in a pre-announced noisy computation by an analyst, so that the database itself is endogenously determined by individuals' participation choices. The privacy an agent receives depends both on the announced noise level, as well as how many agents choose to participate in the database. Each agent has some minimum privacy requirement, and decides whether or not to participate based on how her privacy requirement compares against her expectation of the privacy she will receive if she participates in the computation. This gives rise to a game amongst the agents, where each individual's privacy if she participates, and therefore her participation choice, depends on the choices of the rest of the population.
We investigate symmetric Bayes-Nash equilibria, which in this game consist of threshold strategies, where all agents whose privacy requirements are weaker than a certain threshold participate and the remaining agents do not. We characterize these equilibria, which depend both on the noise announced by the analyst and the population size; present results on existence, uniqueness, and multiplicity; and discuss a number of surprising properties they display.

References

[1]
Aperjis, C. and Huberman, B. 2012. A market for unbiased private data: Paying individuals according to their privacy attitudes. Available at SSRN 2046861.
[2]
Bagnoli, M. and Lipman, B. 1989. Provision of public goods: Fully implementing the core through private contributions. The Review of Economic Studies 56, 4, 583--601.
[3]
Brandt, F. and Sandholm, T. 2008. On the existence of unconditionally privacy-preserving auction protocols. ACM Transactions on Information and System Security (TISSEC) 11, 2, 6.
[4]
Chen, Y., Chong, S., Kash, I., Moran, T., and Vadhan, S. 2011. Truthful mechanisms for agents that value privacy. arXiv preprint arXiv:1111.5472.
[5]
Dandekar, P., Fawaz, N., and Ioannidis, S. 2012. Privacy auctions for recommender systems. In Workshop on Internet Economics (WINE).
[6]
Dinur, I. and Nissim, K. 2003. Revealing information while preserving privacy. In Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM Press New York, NY, USA, 202--210.
[7]
Dwork, C., McSherry, F., Nissim, K., and Smith, A. 2006. Calibrating noise to sensitivity in private data analysis. In Proc. Theory of Cryptography Conference. 265--284.
[8]
Dwork, C. and Nissim, K. 2004. Privacy-preserving datamining on vertically partitioned databases. In In CRYPTO. Springer, 528--544.
[9]
Easley, D. and Kleinberg, J. 2010. Networks, Crowds, and Markets. Cambridge University Press.
[10]
Edlin, A., Farrell, J., and Segal, I. 1998. The Edlin, Farrell, Segal mechanism for the establishment of the Berkeley Electronic Press. Personal communcation from Preston McAfee.
[11]
Feigenbaum, J., Jaggard, A., and Schapira, M. 2010. Approximate privacy: foundations and quantification. In Proceedings of the 11th ACM conference on Electronic commerce. ACM, 167--178.
[12]
Feigenbaum, J., Mitzenmacher, M., and Zervas, G. 2012. An economic analysis of user-privacy options in ad-supported services. arXiv preprint arXiv:1208.0383.
[13]
Fleischer, L. and Lyu, Y. 2012. Approximately optimal auctions for selling privacy when costs are correlated with data. In Proceedings of the 13th ACM Conference on Electronic Commerce. ACM, 568--585.
[14]
Fudenberg, D. and Tirole, J. 1991. Game Theory. MIT Press.
[15]
Ghosh, A. and Roth, A. 2011. Selling privacy at auction. In Proceedings of the 12th ACM conference on Electronic commerce. ACM, 199--208.
[16]
Gkatzelis, V., Aperjis, C., and Huberman, B. 2012. Pricing private data. Available at SSRN 2146966.
[17]
Huang, Z. and Kannan, S. 2012. The exponential mechanism for social welfare: Private, truthful, and nearly optimal.
[18]
Isaacman, S., Ioannidis, S., Chaintreau, A., and Martonosi, M. 2011. Distributed rating prediction in user generated content streams. In Proceedings of the ACM RecSys.
[19]
Kearns, M., Pai, M., Roth, A., and Ullman, J. 2012. Mechanism design in large games: Incentives and privacy. arXiv preprint arXiv:1207.4084.
[20]
Kleinberg, J., Papadimitriou, C., and Raghavan, P. 2001. On the value of private information. In Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge. Morgan Kaufmann Publishers Inc., 249--257.
[21]
Laudon, K. 1993. Markets and privacy. Information Systems Working Papers Series, Vol.
[22]
Leyton-Brown, K. and Shoham, Y. 2008. Essentials of Game Theory: A Consise, Multidisciplinary Introduction. Morgan and Claypool.
[23]
Li, C., Li, D., Miklau, G., and Suciu, D. 2012. A theory of pricing private data. In International Conference on Database Theory (ICDT).
[24]
Ligett, K. and Roth, A. 2012. Take it or leave it: Running a survey when privacy comes at a cost. In Workshop on Internet Economics (WINE).
[25]
McSherry, F. and Talwar, K. 2007. Mechanism design via differential privacy. In Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium on. IEEE, 94--103.
[26]
Naor, M., Pinkas, B., and Sumner, R. 1999. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM conference on Electronic commerce. ACM, 129--139.
[27]
Nissim, K., Orlandi, C., and Smorodinsky, R. 2012a. Privacy-aware mechanism design. In Proceedings of the 13th ACM Conference on Electronic Commerce. ACM, 774--789.
[28]
Nissim, K., Smorodinsky, R., and Tennenholtz, M. 2012b. Approximately optimal mechanism design via differential privacy. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ACM, 203--213.
[29]
Roth, A. and Schoenebeck, G. 2012. Conducting truthful surveys, cheaply. In Proceedings of the 13th ACM Conference on Electronic Commerce. ACM, 826--843.
[30]
Samuelson, P. 1983. Foundations of Economic Analysis. Harvard University Press.
[31]
Varian, H. 1994. Sequential contributions to public goods. Journal of Public Economics 53, 2, 165--186.
[32]
Xiao, D. 2013. Is privacy compatible with truthfulness? In Innovations in Theoretical Computer Science (ITCS).

Cited By

View all
  • (2023)Privacy Protection Under Incomplete Social and Data Correlation InformationIEEE/ACM Transactions on Networking10.1109/TNET.2023.325454931:6(2515-2528)Online publication date: Dec-2023
  • (2020)Benefits of formalized computational modeling for understanding user behavior in online privacy researchJournal of Intellectual Capital10.1108/JIC-05-2019-0126ahead-of-print:ahead-of-printOnline publication date: 14-Mar-2020
  • (2019)If You Do Not Care About It, Sell It: Trading Location Privacy in Mobile Crowd SensingIEEE INFOCOM 2019 - IEEE Conference on Computer Communications10.1109/INFOCOM.2019.8737457(1045-1053)Online publication date: Apr-2019
  • Show More Cited By

Index Terms

  1. Privacy and coordination: computing on databases with endogenous participation

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    EC '13: Proceedings of the fourteenth ACM conference on Electronic commerce
    June 2013
    924 pages
    ISBN:9781450319621
    DOI:10.1145/2492002
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 16 June 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. database privacy
    2. differential privacy

    Qualifiers

    • Research-article

    Conference

    EC '13
    Sponsor:
    EC '13: ACM Conference on Electronic Commerce
    June 16 - 20, 2013
    Pennsylvania, Philadelphia, USA

    Acceptance Rates

    EC '13 Paper Acceptance Rate 72 of 223 submissions, 32%;
    Overall Acceptance Rate 664 of 2,389 submissions, 28%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 14 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Privacy Protection Under Incomplete Social and Data Correlation InformationIEEE/ACM Transactions on Networking10.1109/TNET.2023.325454931:6(2515-2528)Online publication date: Dec-2023
    • (2020)Benefits of formalized computational modeling for understanding user behavior in online privacy researchJournal of Intellectual Capital10.1108/JIC-05-2019-0126ahead-of-print:ahead-of-printOnline publication date: 14-Mar-2020
    • (2019)If You Do Not Care About It, Sell It: Trading Location Privacy in Mobile Crowd SensingIEEE INFOCOM 2019 - IEEE Conference on Computer Communications10.1109/INFOCOM.2019.8737457(1045-1053)Online publication date: Apr-2019
    • (2018)A Differential Privacy Mechanism with Network Effects for Crowdsourcing SystemsProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3238050(1998-2000)Online publication date: 9-Jul-2018
    • (2018)Choosing Epsilon for Privacy as a ServiceProceedings on Privacy Enhancing Technologies10.2478/popets-2019-00112019:1(192-205)Online publication date: 24-Dec-2018
    • (2018)The Value of PrivacyACM Transactions on Economics and Computation10.1145/32328636:2(1-26)Online publication date: 9-Aug-2018
    • (2018)Semantic Security for Sharing Computing Knowledge/InformationCyber Security10.1007/978-981-10-8536-9_45(475-481)Online publication date: 28-Apr-2018
    • (2017)A Privacy-Aware Conceptual Framework for Coordination2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)10.1109/ISPA/IUCC.2017.00036(190-197)Online publication date: Dec-2017
    • (2017)Optimal Privacy-Preserving Data Collection: A Prospect Theory PerspectiveGLOBECOM 2017 - 2017 IEEE Global Communications Conference10.1109/GLOCOM.2017.8254991(1-6)Online publication date: Dec-2017
    • (2016)An Antifolk Theorem for Large Repeated GamesACM Transactions on Economics and Computation10.1145/29767345:2(1-20)Online publication date: 12-Oct-2016
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media