An Extended Ultimatum Game for Multi-Party Access Control in Social Networks

Author:

Squicciarini Anna1ORCID,Rajtmajer Sarah1ORCID,Gao Yang1ORCID,Semonsen Justin1ORCID,Belmonte Andrew1ORCID,Agarwal Pratik1ORCID

Affiliation:

1. Pennsylvania State University, PA, USA

Abstract

In this article, we aim to answer an important set of questions about the potential longitudinal effects of repeated sharing and privacy settings decisions over jointly managed content among users in a social network. We model user interactions through a repeated game in a network graph. We present a variation of the one-shot Ultimatum Game, wherein individuals interact with peers to make a decision on a piece of shared content. The outcome of this game is either success or failure, wherein success implies that a satisfactory decision for all parties is made and failure instead implies that the parties could not reach an agreement. Our proposed game is grounded in empirical data about individual decisions in repeated pairwise negotiations about jointly managed content in a social network. We consider both a “continuous” privacy model as well the “discrete” case of a model wherein privacy values are to be chosen among a fixed set of options. We formally demonstrate that over time, the system converges toward a “fair” state, wherein each individual’s preferences are accounted for. Our discrete model is validated by way of a user study, where participants are asked to propose privacy settings for own shared content from a small, discrete set of options.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference50 articles.

1. Privacy in electronic commerce and the economics of immediate gratification

2. Opinions, influence, and zealotry: a computational study on stubbornness

3. Moving beyond untagging

4. Privacy aware data sharing

5. Brandwatch.com. 2016. Facebook Statistics from Brandwatch. Retrieved on September 9 2022 from https://www.brandwatch.com/blog/47-facebook-statistics-2016/.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Bargaining-Game Framework for Multi-Party Access Control;Proceedings of the 29th ACM Symposium on Access Control Models and Technologies;2024-06-24

2. On the Emergence of Fairness in the Evolutionary Dictator Game with Edge Weight Learning;2023 31st Irish Conference on Artificial Intelligence and Cognitive Science (AICS);2023-12-07

3. A Psychometric Scale to Measure Individuals’ Value of Other People’s Privacy (VOPP);Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems;2023-04-19

4. On the Potential of Mediation Chatbots for Mitigating Multiparty Privacy Conflicts - A Wizard-of-Oz Study;Proceedings of the ACM on Human-Computer Interaction;2023-04-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3