Title
Privacy as a coordination game
Abstract
In Ghosh-Ligett 2013, we propose a simple model where individuals in a privacy-sensitive population with privacy requirements 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. Agents decide whether or not to participate based on how their privacy requirement compares against their expectation of the privacy they will receive. 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 in this game which consist of threshold strategies, where all agents with requirements above 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.
Year
DOI
Venue
2013
10.1109/Allerton.2013.6736721
Communication, Control, and Computing
Keywords
DocType
ISSN
data privacy,game theory,multi-agent systems,agents,coordination game,database,preannounced noisy computation,privacy requirements,privacy-sensitive population,symmetric Bayes-Nash equilibria,threshold strategies
Conference
2474-0195
ISBN
Citations 
PageRank 
978-1-4799-3409-6
0
0.34
References 
Authors
14
2
Name
Order
Citations
PageRank
Arpita Ghosh101.01
Katrina Ligett292366.19