TY - GEN
T1 - Constrained social-energy minimization for multi-party sharing in online social networks
AU - Rajtmajer, Sarah
AU - Squicciarini, Anna
AU - Griffin, Christopher
AU - Karumanchi, Sushama
AU - Tyagi, Alpana
N1 - Funding Information:
Portions of Dr. Griffin's, Dr. Squicciarini's and Dr. Rajtmajer's work were supported by the Army Research Office under grant W911NF-13-1-0271. Portions of Dr. Squicciarini's work were additionally supported by a National Science Foundation grant 1453080.
Publisher Copyright:
Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
PY - 2016
Y1 - 2016
N2 - The development of fair and practical policies for shared content online is a primary goal of the access control community. Multi-party access control, in which access control policies are determined by multiple users each with vested interest in a piece of shared content, remains an outstanding challenge. Purposeful or accidental disclosures by one user in an online social network (OSN) may have negative consequences for others, highlighting the importance of appropriate sharing mechanisms. In this work, we develop a game-theoretic framework for modeling multi-party privacy decisions for shared content. We assume that the content owner (uploader) selects an initial privacy policy that constrains the privacy settings of other users. We prove the convergence of users' access control policies assuming a multi-round consensus-building game in which all players are fully rational and investigate a variation of rational play that better describes user behavior and also leads to the rational equilibrium. Additionally, in an effort to better approximate human behavior, we study a bounded rationality model and simulate real user choices in this context. Finally, we validate model assumptions and conclusions using experimental data obtained through a study of 95 individuals in a mock-social network.
AB - The development of fair and practical policies for shared content online is a primary goal of the access control community. Multi-party access control, in which access control policies are determined by multiple users each with vested interest in a piece of shared content, remains an outstanding challenge. Purposeful or accidental disclosures by one user in an online social network (OSN) may have negative consequences for others, highlighting the importance of appropriate sharing mechanisms. In this work, we develop a game-theoretic framework for modeling multi-party privacy decisions for shared content. We assume that the content owner (uploader) selects an initial privacy policy that constrains the privacy settings of other users. We prove the convergence of users' access control policies assuming a multi-round consensus-building game in which all players are fully rational and investigate a variation of rational play that better describes user behavior and also leads to the rational equilibrium. Additionally, in an effort to better approximate human behavior, we study a bounded rationality model and simulate real user choices in this context. Finally, we validate model assumptions and conclusions using experimental data obtained through a study of 95 individuals in a mock-social network.
UR - http://www.scopus.com/inward/record.url?scp=85013207762&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85013207762&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85013207762
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 680
EP - 688
BT - AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016
Y2 - 9 May 2016 through 13 May 2016
ER -