Influence propagation in adversarial setting: How to defeat competition with least amount of investment

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 585-594

  Shirazipourazad, Shahrzad ^a   Bogard, Brian ^a   Vachhani, Harsh ^a   Sen, Arunabha ^a   Horn, Paul ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

adversarial environment; influence maximization; social networks

Indexed keywords

ADVERSARIAL ENVIRONMENTS; COLLABORATION NETWORK; COMPETITIVE ENVIRONMENT; GREEDY ALGORITHMS; INFLUENCE MAXIMIZATIONS; INFLUENTIAL NODES; NODE DEGREE; NP-HARD; PERFORMANCE BOUNDS; PROPAGATION MODELS; PROPAGATION PROCESS; REALISTIC SCENARIO; SOCIAL NETWORKS;

KNOWLEDGE MANAGEMENT; SOCIAL NETWORKING (ONLINE);

APPROXIMATION ALGORITHMS;

EID: 84871039983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396837     Document Type: Conference Paper

References (18)

1. S. Bhagat, A. Goyal, and L. V. Lakshmanan. Maximizing product adoption in social networks. In Proceedings of the fifth ACM international conference on Web search and data mining, WSDM '12, pages 603{612, 2012.
2. S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In Proceedings of the 3rd international conference on Internet and network economics, WINE'07, pages 306-311, 2007.
3. T. Carnes, C. Nagarajan, S. M. Wild, and A. van Zuylen. Maximizing inuflence in a competitive social network: a follower's perspective. In Proceedings of the ninth international conference on Electronic commerce, ICEC '07, pages 351-360, 2007.
4. W. Chen, Y. Wang, and S. Yang. Efficient inuflence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pages 199-208, 2009.
5. K. Dave, R. Bhatt, and V. Varma. Modelling action cascades in social networks. 2011.
6. P. Domingos and M. Richardson. Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '01, pages 57-66, 2001.
7. A. Goyal, F. Bonchi, L. V. S. Lakshmanan, and S. Venkatasubramanian. Approximation analysis of influence spread in social networks. arXiv:1008.2005v4, 2011.
8. H. Habiba, Y. Yu, T. Y. Berger-Wolf, and J. Saia. Finding spread blockers in dynamic networks. In Proceedings of the Second international conference on Advances in social network mining and analysis, SNAKDD'08, pages 55-76, 2010.
9. G. Istrate, M. V. Marathe, and S. S. Ravi. Adversarial models in evolutionary game dynamics. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, SODA '01, pages 719-720, 2001.
10. Q. Jiang, G. Song, C. Gao, Y. Wang, W. Si, and K. Xie. Simulated annealing based influence maximization in social networks. 2011.
11. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of inuence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '03, pages 137-146, 2003.
12. H. Li, S. S. Bhowmick, and A. Sun. Casino: towards conformity-aware social inuence analysis in online social networks. In Proceedings of the 20th ACM international conference on Information and knowledge management, CIKM '11, pages 1007-1012, 2011.
13. M. Mathioudakis, F. Bonchi, C. Castillo, A. Gionis, and A. Ukkonen. Sparsification of influence networks. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pages 529-537, 2011.
14. M. Newman. http://networkdata.ics.uci.edu/data/hep-th/.
15. M. E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America, 98(2):404-409, 2001.
16. M. A. Nowak, C. E. Tarnita, and T. Antal. Evolutionary dynamics in structured populations. Philosophical Transactions of the Royal Society B: Biological Sciences, 365(1537):19-30, 2010.
17. Y. Wang, G. Cong, G. Song, and K. Xie. Community-based greedy algorithm for mining top-k inuential nodes in mobile social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pages 1039-1048, 2010.
18. S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Number 8 in Structural analysis in the social sciences. Cambridge University Press, 1 edition, 1994.