Maximizing influence propagation for new agents in Competitive Environments

Xiang Zhang, Dejun Yang, G. Xue
{"title":"Maximizing influence propagation for new agents in Competitive Environments","authors":"Xiang Zhang, Dejun Yang, G. Xue","doi":"10.1109/ICC.2014.6883935","DOIUrl":null,"url":null,"abstract":"In a competitive environment, competing agents would maximize their ideas' influence for higher profits. For example, in an unsaturated market, when a new company participates in the market sharing competition, it would distribute free tryout or discount to several customers, let them adopt the product or service, and influence others to use this product as propagation goes. This situation can also be applied to other scenarios, such as spreading new ideas in online social networks, political elections, and so on. In this paper, we use a model called Dynamic Influence in Competitive Environments (DICE) to perform the influence propagation. We first prove that finding the optimal utility for the new agent is an NP-hard problem under DICE. Then, we provide an algorithm for these new companies, and prove that the algorithm has a (1/3 - ϵ/n)-approximation ratio to the maximum payoff value. Performance results show that our algorithm has a better performance compared to existing strategies in terms of maximizing the utility for new agents.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2014.6883935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In a competitive environment, competing agents would maximize their ideas' influence for higher profits. For example, in an unsaturated market, when a new company participates in the market sharing competition, it would distribute free tryout or discount to several customers, let them adopt the product or service, and influence others to use this product as propagation goes. This situation can also be applied to other scenarios, such as spreading new ideas in online social networks, political elections, and so on. In this paper, we use a model called Dynamic Influence in Competitive Environments (DICE) to perform the influence propagation. We first prove that finding the optimal utility for the new agent is an NP-hard problem under DICE. Then, we provide an algorithm for these new companies, and prove that the algorithm has a (1/3 - ϵ/n)-approximation ratio to the maximum payoff value. Performance results show that our algorithm has a better performance compared to existing strategies in terms of maximizing the utility for new agents.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在竞争环境中最大化新代理的影响力传播
在竞争环境中,相互竞争的代理人会最大化他们的想法的影响力以获得更高的利润。例如,在一个不饱和的市场中,当一家新公司参与市场份额竞争时,它会向几个客户分发免费试用或折扣,让他们采用该产品或服务,并影响其他人使用该产品。这种情况也可以应用于其他场景,例如在在线社交网络中传播新思想,政治选举等。在本文中,我们使用一个称为竞争环境中的动态影响(DICE)模型来执行影响传播。我们首先证明了在DICE下寻找新智能体的最优效用是一个np困难问题。然后,我们为这些新公司提供了一个算法,并证明该算法对最大收益值具有(1/3 - λ /n)-近似比。性能结果表明,在最大化新代理的效用方面,我们的算法与现有策略相比具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed DTX alignment with memory Throughput maximization with channel acquisition in energy harvesting systems Energy exchange among base stations in a Cellular Network through the Smart Grid Smart grid enabled mobile networks: Jointly optimizing BS operation and power distribution Distance-based energy-efficient opportunistic forwarding in mobile delay tolerant networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1