Combining Traditional Marketing and Viral Marketing with Amphibious Influence Maximization

Wei Chen, Fu Li, Tian Lin, A. Rubinstein
{"title":"Combining Traditional Marketing and Viral Marketing with Amphibious Influence Maximization","authors":"Wei Chen, Fu Li, Tian Lin, A. Rubinstein","doi":"10.1145/2764468.2764480","DOIUrl":null,"url":null,"abstract":"In this paper, we propose the amphibious influence maximization (AIM) model that combines traditional marketing via content providers and viral marketing to consumers in social networks in a single framework. In AIM, a set of content providers and consumers form a bipartite network while consumers also form their social network, and influence propagates from the content providers to consumers and among consumers in the social network following the independent cascade model. An advertiser needs to select a subset of seed content providers and a subset of seed consumers, such that the influence from the seed providers passing through the seed consumers could reach a large number of consumers in the social network in expectation. We prove that the AIM problem is NP-hard to approximate to within any constant factor via a reduction from Feige's k-prover proof system for 3-SAT5. We also give evidence that even when the social network graph is trivial (i.e. has no edges), a polynomial time constant factor approximation for AIM is unlikely. However, when we assume that the weighted bi-adjacency matrix that describes the influence of content providers on consumers is of constant rank, a common assumption often used in recommender systems, we provide a polynomial-time algorithm that achieves approximation ratio of (1-1/e-ε)3 for any (polynomially small) ε > 0. Our algorithmic results still hold for a more general model where cascades in social network follow a general monotone and submodular function.","PeriodicalId":376992,"journal":{"name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","volume":"07 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2764468.2764480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

In this paper, we propose the amphibious influence maximization (AIM) model that combines traditional marketing via content providers and viral marketing to consumers in social networks in a single framework. In AIM, a set of content providers and consumers form a bipartite network while consumers also form their social network, and influence propagates from the content providers to consumers and among consumers in the social network following the independent cascade model. An advertiser needs to select a subset of seed content providers and a subset of seed consumers, such that the influence from the seed providers passing through the seed consumers could reach a large number of consumers in the social network in expectation. We prove that the AIM problem is NP-hard to approximate to within any constant factor via a reduction from Feige's k-prover proof system for 3-SAT5. We also give evidence that even when the social network graph is trivial (i.e. has no edges), a polynomial time constant factor approximation for AIM is unlikely. However, when we assume that the weighted bi-adjacency matrix that describes the influence of content providers on consumers is of constant rank, a common assumption often used in recommender systems, we provide a polynomial-time algorithm that achieves approximation ratio of (1-1/e-ε)3 for any (polynomially small) ε > 0. Our algorithmic results still hold for a more general model where cascades in social network follow a general monotone and submodular function.
传统营销与病毒营销相结合,实现两栖影响力最大化
在本文中,我们提出了两栖影响最大化(AIM)模型,该模型将通过内容提供商进行的传统营销和在社交网络中对消费者进行的病毒式营销结合在一个单一框架中。在AIM中,一组内容提供者和消费者组成了一个双向网络,消费者也组成了自己的社交网络,影响力在社交网络中从内容提供者向消费者、消费者之间传播,遵循独立的级联模型。广告主需要选择种子内容提供者的子集和种子消费者的子集,这样通过种子消费者的种子提供者的影响力才能在预期中到达社交网络中的大量消费者。我们通过Feige的3-SAT5的k-证明系统的约简证明了AIM问题在任意常数因子内是np困难的。我们也给出了证据,即使当社交网络图是平凡的(即没有边),AIM的多项式时间常数因子近似是不可能的。然而,当我们假设描述内容提供者对消费者的影响的加权双邻接矩阵具有恒定的秩(推荐系统中经常使用的一个常见假设)时,我们提供了一个多项式时间算法,对于任何(多项式小)ε > 0,该算法实现近似比为(1-1/e-ε)3。我们的算法结果仍然适用于更一般的模型,其中社交网络中的级联遵循一般单调和次模函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信