Pricing Social Visibility Service in Online Social Networks: Modeling and Algorithms

被引:1
作者
Zheng, Shiyuan [1 ]
Xie, Hong [2 ]
Lui, John C. S. [1 ]
机构
[1] Chinese Univ Hong Kong, Dept Comp Sci Engn, Cent Ave, Hong Kong, Peoples R China
[2] Chinese Acad Sci, Chongqing Inst Green, Intelligent Technol, Beijing 100045, Peoples R China
来源
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING | 2023年 / 10卷 / 02期
关键词
Approximation algorithms; revenue maximization; social visibility; welfare maximization; LINK-PREDICTION;
D O I
10.1109/TNSE.2022.3223958
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Online social networks (OSNs) such as YouTube, Instagram, Twitter, Facebook, etc., serve as important platforms for users to share their information or content to friends or followers. Oftentimes, users want to enhance their social visibility, as it can make their contents, i.e., opinions, videos, pictures, etc., attract attention from more users, which in turn may bring higher commercial benefits to them. Motivated by this, we propose a mechanism, where the OSN operator provides a "social visibility boosting service" to incentivize "transactions" between requesters (users who seek to enhance their social visibility via adding new "neighbors") and suppliers (users who are willing to be added as a new "neighbor" of any requester when certain "rewards" is provided). We design a posted pricing scheme for the OSN provider to charge the requesters who use such boosting service and reward the suppliers who make contributions. The OSN operator keeps a fraction of the payment from requesters and distributes the remaining part to participating suppliers "fairly" via a rewarding rule based on Shapley value. We consider two different objectives/problems of the OSN provider, i.e., to select the optimal prices and supplier set to maximize (1) the revenue or (2) the welfare increase, under the requesters' budget constraint on suppliers. We first show that the problems are not simpler than NP-hard. We then decomposed each problem into two sub-routines, where one focuses on selecting the optimal set of suppliers, and the other one focuses on selecting the optimal prices. We prove the hardness of each sub-routine, and eventually design a computationally efficient approximation algorithm to solve the problems with provable theoretical guarantee on the revenue/welfare increase gap. We conduct extensive experiments on four public datasets to validate the performance of our proposed algorithms.
引用
收藏
页码:859 / 870
页数:12
相关论文
共 17 条
[1]  
[Anonymous], 2011, P FORTH INT C WEB SE, DOI DOI 10.1145/1935826.1935877
[2]   Approximating power indices: theoretical and empirical analysis [J].
Bachrach, Yoram ;
Markakis, Evangelos ;
Resnick, Ezra ;
Procaccia, Ariel D. ;
Rosenschein, Jeffrey S. ;
Saberi, Amin .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2010, 20 (02) :105-122
[3]  
Domingos P., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P57, DOI 10.1145/502512.502525
[4]  
Kempe D., 2003, P 9 ACM SIGKDD INT C, P137
[5]  
Kunegis J, 2013, PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'13 COMPANION), P1343
[6]   The link-prediction problem for social networks [J].
Liben-Nowell, David ;
Kleinberg, Jon .
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2007, 58 (07) :1019-1031
[7]   Boosting Information Spread: An Algorithmic Approach [J].
Lin, Yishi ;
Chen, Wei ;
Lui, John C. S. .
2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017), 2017, :883-894
[8]   Link prediction in complex networks: A survey [J].
Lue, Linyuan ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (06) :1150-1170
[9]   On Measuring Social Friend Interest Similarities in Recommender Systems [J].
Ma, Hao .
SIGIR'14: PROCEEDINGS OF THE 37TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2014, :465-474
[10]   A Survey of Link Prediction in Complex Networks [J].
Martinez, Victor ;
Berzal, Fernando ;
Cubero, Juan-Carlos .
ACM COMPUTING SURVEYS, 2017, 49 (04)