TY - GEN
T1 - A mean-field stackelberg game approach for obfuscation adoption in empirical risk minimization
AU - Pawlick, Jeffrey
AU - Zhu, Quanyan
N1 - Funding Information:
1This work is partially supported by an NSF IGERT grant through the Center for Interdisciplinary Studies in Security and Privacy (CRISSP) at New York University, by the grant CNS-1544782, EFRI-1441140, and SES-1541164 from National Science Foundation (NSF) and DE-NE0008571 from the Department of Energy.
Publisher Copyright:
© 2017 IEEE.
PY - 2018/3/7
Y1 - 2018/3/7
N2 - Data ecosystems are becoming larger and more complex, while privacy concerns are threatening to Erode their potential benefits. Recently, users have developed obfuscation techniques that issue fake search engine queries, undermine location tracking algorithms, or evade government surveillance. These techniques raise one conflict between each user and the machine learning algorithms which track the users, and one conflict between the users themselves. We use game theory to capture the first conflict with a Stackelberg game and the second conflict with a mean field game. Both are combined into a bi-level framework which quantifies accuracy using empirical risk minimization and privacy using differential privacy. We identify necessary and sufficient conditions under which 1) each user is incentivized to obfuscate if other users are obfuscating, 2) the tracking algorithm can avoid this by promising a level of privacy protection, and 3) this promise is incentive-compatible for the tracking algorithm.
AB - Data ecosystems are becoming larger and more complex, while privacy concerns are threatening to Erode their potential benefits. Recently, users have developed obfuscation techniques that issue fake search engine queries, undermine location tracking algorithms, or evade government surveillance. These techniques raise one conflict between each user and the machine learning algorithms which track the users, and one conflict between the users themselves. We use game theory to capture the first conflict with a Stackelberg game and the second conflict with a mean field game. Both are combined into a bi-level framework which quantifies accuracy using empirical risk minimization and privacy using differential privacy. We identify necessary and sufficient conditions under which 1) each user is incentivized to obfuscate if other users are obfuscating, 2) the tracking algorithm can avoid this by promising a level of privacy protection, and 3) this promise is incentive-compatible for the tracking algorithm.
KW - Differential Privacy
KW - Empirical Risk Minimization
KW - Mean-Field Game
KW - Obfuscation
KW - Stackelberg Game
UR - http://www.scopus.com/inward/record.url?scp=85048117923&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048117923&partnerID=8YFLogxK
U2 - 10.1109/GlobalSIP.2017.8308697
DO - 10.1109/GlobalSIP.2017.8308697
M3 - Conference contribution
AN - SCOPUS:85048117923
T3 - 2017 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2017 - Proceedings
SP - 518
EP - 522
BT - 2017 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th IEEE Global Conference on Signal and Information Processing, GlobalSIP 2017
Y2 - 14 November 2017 through 16 November 2017
ER -