TY - GEN
T1 - Maximizing influence propagation for new agents in Competitive Environments
AU - Zhang, Xiang
AU - Yang, Dejun
AU - Xue, Guoliang
PY - 2014/1/1
Y1 - 2014/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84906997541&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84906997541&partnerID=8YFLogxK
U2 - 10.1109/ICC.2014.6883935
DO - 10.1109/ICC.2014.6883935
M3 - Conference contribution
AN - SCOPUS:84906997541
SN - 9781479920037
T3 - 2014 IEEE International Conference on Communications, ICC 2014
SP - 3932
EP - 3937
BT - 2014 IEEE International Conference on Communications, ICC 2014
PB - IEEE Computer Society
T2 - 2014 1st IEEE International Conference on Communications, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -