Sybil-Proof Mechanism for Information Propagation with Budgets
Junjie Zheng, Xu Ge, Bin Li, Dengji Zhao

TL;DR
This paper introduces PRDM, a reward mechanism that incentivizes participation and sharing in social networks for crowdsourcing, while preventing strategic manipulations like Sybil attacks.
Contribution
The paper proposes a novel reward mechanism, PRDM, that ensures full participation, information sharing, and Sybil attack prevention in budget-constrained social networks.
Findings
PRDM incentivizes agents to fully contribute and share information.
PRDM effectively prevents Sybil attacks.
PRDM operates under general information propagation models with limited budgets.
Abstract
This paper examines the problem of distributing rewards on social networks to improve the efficiency of crowdsourcing tasks for sponsors. To complete the tasks efficiently, we aim to design reward mechanisms that incentivize early-joining agents to invite more participants to the tasks. Nonetheless, participants could potentially engage in strategic behaviors, e.g., not inviting others to the tasks, misreporting their capacity for the tasks, or creaking fake identities (aka Sybil attacks), to maximize their own rewards. The focus of this study is to address the challenge outlined above by designing effective reward mechanisms. To this end, we propose a novel reward mechanism, called Propagation Reward Distribution Mechanism (PRDM), for the general information propagation model with limited budgets. It is proved that the PRDM can not only incentivize all agents to contribute their full…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications
