［1］MBA智库·百科.斯塔克尔伯格模型［EBOL］. ［20220507］. https:wiki.mbalib.comwiki斯塔克尔伯格模型［2］Higgins R S. An economic theory of leader choice in Stackelberg models［J］. Journal of Economic Studies,1996, 23(56): 7995［3］Bharathi S, Kempe D, Salek M. Competitive influence maximization in social networks［C］ Proc of the 3rd Int Conf on Internet and Network Economics. New York: ACM, 2007: 306311［4］Kostka J, Oswald Y A, Wattenhofer R. Word of mouth: Rumor dissemination in social networks［G］ SIROCCO 2008: Structural Information and Communication Complexity. Berlin: Springer, 2008: 185196［5］Clark A, Poovendran R. Maximizing influence in competitive environments: A gametheoretic approach［G］ GameSec 2011: Decision and Game Theory for Security. Berlin: Springer, 2011: 151162［6］Hemmati M, Smith J C, Thai M T. A cuttingplane algorithm for solving a weighted influence interdiction problem［J］. Computational Optimization and Applications, 2014, 57(1): 71104［7］Taninmis K, Aras N, Altinel I K. Influence maximization with deactivation in social networks［J］. European Journal of Operational Research, 2019, 278(1): 105119［8］PastorSatorras R, Vespignani A. Immunization of complex networks［EBOL］. (20020208) ［20220507］. https:journals.aps.orgpreabstract10.1103PhysRevE.65.036104［9］Cohen R, Havlin S, BenAvraham D. Efficient immunization strategies for computer networks and populations［EBOL］. (20031110) ［20220507］. https:arxiv.orgabscondmat0207387［10］Kitsak M，Gallos L K, Havlin S, et al. Identification of influential spreaders in complex networks［J］. Nature Physics, 2010, 6(11): 888893［11］Hou B, Yao Y, Liao D. Identifying allaround nodes for spreading dynamics in complex networks［J］. Physica A: Statistical Mechanics and Its Applications, 2012, 391(15): 40124017［12］Liu J G, Ren Z M, Guo Q. Ranking the spreading influence incomplex networks［J］. Physica A: Statistical Mechanics and Its Applications, 2013, 392(18): 41544159［13］Zhang Y, Prakash B A. Dava: Distributing vaccines over networks under prior information［C］ Proc of the 2014 SIAM Int Conf on Data Mining. Philadelphia, PA: SIAM, 2014: 4654［14］Zhang Y, Adiga A, Saha S, et al. Nearoptimal algorithms for controlling propagation at group scale on networks［C］ Proc of IEEE Trans on Knowledge and Data Engineering. Piscataway, NJ: IEEE, 2016: 33393352［15］Lü L, Chen D, Ren X L, et al. Vital nodes identification in complex networks［J］. Physics Reports, 2016, 650(9): 163［16］Kimura M, Saito K, Motoda H. Minimizing the spread of contamination by blocking links in a network［C］ Proc of the 23rd National Conf on Artificial Intelligence. New York: ACM, 2008: 11751180［17］Kimura M, Saito K, Motoda H. Blocking links to minimize contamination spread in a social network［J］. ACM Trans on Knowledge Discovery from Data, 2009, 3(2): 123［18］Tong H, Prakash B A, EliassiRad T, et al. Gelling and melting, large graphs by edge manipulation［C］ Proc of the 21st ACM Int Conf on Information and Knowledge Management. New York: ACM, 2012: 245254［19］Kuhlman C J, Tuli G, Swarup S, et al. Blocking simple and comple contagion by edge removal［C］ Proc of the 13th IEEE Int Conf on Data Mining. Piscataway, NJ: IEEE, 2013: 399408［20］Khalil E B, Dilkina B, Song L. Scalable diffusionaware optimization of network topology［C］ Proc of the 20th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2014: 12261235［21］Gómez S, Arenas A, BorgeHolthoefer J, et al. Discretetime Markov chain approach to contactbased disease spreading in complex networks［J］. Europhysics Letters, 2010, 89(3): 16 ［22］Wu Q, Fu X, Jin Z, et al. Influence of dynamic immunization on epidemic spreading in networks［J］. Physica A: Statistical Mechanics and Its Applications, 2015, 419(2): 566574［23］Yang L X, Draief M, Yang X. The optimal dynamic immunization under a controlled heterogeneous nodebased sirs model［J］. Physica A: Statistical Mechanics and Its Applications, 2016, 450(5): 403415［24］刘晓东. 大规模社会网络中影响最大化问题高效处理技术研究［D］. 长沙: 国防科技大学, 2013［25］Zhang J, Wang S, Zhan Q, et al. Interwined viral marketing in social networks［C］ Proc of the 2016 IEEEACM Int Conf on Advances in Social Networks Analysis and Mining. Piscataway, NJ: IEEE, 2016: 239246［26］Carnes T, Nagarajan C, Wild S M, et al. Maximizing influence in a competitive social network: A follower’s perspective［C］ Proc of the 9th Int Conf on Electronic Commerce. New York: ACM, 2007: 351360［27］Bharathi S, Kempe D, Salek M. Competitive influence maximization in social networks ［C］ Proc of the 3rd Int Conf on Internet and Network Economics. New York: ACM, 2007: 306311 ［28］Chen W, Lu W, Zhang N. Timecritical influence maximization in social networks with timedelayed diffusion process［C］ Proc of the 26th AAAI Conf on Artificial Intelligence. Menlo Park, CA: AAAI, 2012: 592598［29］Lin S C, Lin S D, Chen M S. A learningbased framework to handle multiround multiparty influence maximization on social networks［C］ Proc of the 21st ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2015: 695704［30］Bozorgi A, Samet S, Kwisthout J, et al. Communitybased influence maximization in social networks under a competitive linear threshold model［J］.  KnowledgeBased Systems, 2017, 134(10): 149158［31］Li H, Pan L, Wu P. Dominated competitive influence maximization with timecritical and timedelayed diffusion in social networks［J］. Journal of Computational Science, 2018, 28(9): 318327［32］Pham C V, Duong H V, Hoang H X, et al. Competitive influence maximization within time and budget constraints in online social networks: An algorithmic approach［J］. Applied Sciences, 2019, 9(11): 129 ［33］Chen B L, Sheng Y Y, Ji M, et al. Competitive influence maximization on online social networks under cost constraint［J］. KSII Trans on Internet and Information Systems, 2021, 15(4): 12631274［34］Budak C, Agrawal D, Abbadi A EI. Limiting the spread of misinformation in social networks［C］ Proc of the 20th Int Conf on World Wide Web. New York: ACM, 2011: 665674［35］Nguyen N P, Yan G, Thai M T, et al. Containment of misinformation spread in online social networks ［C］ Proc of the 4th Annual ACM Web Science Conf. New York: ACM, 2012: 213222 ［36］Wang B, Chen G, Fu L, et al. Drimux: Dynamic rumor influence minimization with user experience in social networks［J］. IEEE Trans on Knowledge and Data Engineering, 2016, 29(10): 21682181［37］Rawale S, Birkure S, Hiray K, et al. Detection and minimization influence of rumor in social network［J］.  International Research Journal of Engineering and Technology, 2017, 4(11): 757761［38］Yan R, Zhu Y, Li D, et al. Minimum cost seed set for threshold influence problem under competitive models［J］.  World Wide Web, 2018, 22(6): 29772996［39］GomezRodriguez M, Balduzzi D, Schlkopf B. Uncovering the temporal dynamics of diffusion networks［C］ Proc of the 28th Int Conf on Int Conf on Machine Learning. New York: ACM, 2011: 561568［40］Ribeiro B, Faloutsos C. Modeling website popularity competition in the attentionactivity marketplace［C］ Proc of the 8th ACM Int Conf on Web Search and Data Mining. New York: ACM, 2015: 389398［41］Yuan J, Tang S. No Time to observe: Adaptive influence maximization with partial feedback［C］ Proc of the 26th Int Joint Conf on Artificial Intelligence. New York: ACM, 2017: 39083914［42］Wang F, Jiang W, Li X, et al. Maximizing positive influence spread in online social networks via fluid dynamics［J］.  Future Generation Computer Systems, 2018, 86(9): 14911502［43］Liu B, Cong G, Xu D, et al. Time constrained influence maximization in social networks［C］ Proc of the 12th IEEE Int Conf on Data Mining. Piscataway, NJ: IEEE, 2012: 439448［44］Liu B, Cong G, Zeng Y, et al. Influence spreading path and its application to the time constrained social influence maximization problem and beyond［J］.  IEEE Trans on Knowledge and Data Engineering, 2014, 26(8): 19041917［45］GomezRodriguez M, Balduzzi D, Scholkopf B. Uncovering the temporal dynamics of diffusion network［C］ Proc of the 28th Int Conf on Machine Learning. New York: ACM, 2011: 561568［46］Ohsaka N, Yamaguchi Y, Kakimura N, et al. Maximizing timedecaying influence in social networks［G］ ECML PKDD 2016: Machine Learning and Knowledge Discovery in Databases. Berlin: Springer, 2016: 132147［47］Yang D, Chow T W S, Zhong L, et al. The competitive information spreading over multiples social netowrks［J］.  Physica A: Statistical Mechanics and Its Applications, 2018, 503(8): 981990［48］Yang D, Chow T W S, Zhong L, et al. True and fake information spreading over the Facebook［J］.  Physica A: Statistical Mechanics and Its Applications, 2018, 505(9): 984994