{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T02:02:22Z","timestamp":1780020142888,"version":"3.53.1"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010616","name":"Qiqihar University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010616","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.knosys.2026.116179","type":"journal-article","created":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:18:51Z","timestamp":1778757531000},"page":"116179","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["D2G-DCIM: A deep reinforcement learning and graph neural network-driven model for dynamic competitive influence maximization"],"prefix":"10.1016","volume":"346","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2538-554X","authenticated-orcid":false,"given":"Kaijing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4827-0497","authenticated-orcid":false,"given":"Wenlong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiahui","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youruo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yukun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiaoyan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuangshuang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116179_b1","series-title":"Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.knosys.2026.116179_b2","series-title":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data","first-page":"1539","article-title":"Influence maximization in near-linear time: A martingale approach","author":"Tang","year":"2015"},{"key":"10.1016\/j.knosys.2026.116179_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126384","article-title":"BiGDN: An end-to-end influence maximization framework based on deep reinforcement learning and graph neural networks","volume":"270","author":"Zhu","year":"2025","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.knosys.2026.116179_b4","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","article-title":"Adaptive influence maximization in dynamic social networks","volume":"25","author":"Tong","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.knosys.2026.116179_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.array.2022.100226","article-title":"Maximization influence in dynamic social networks and graphs","volume":"15","author":"Smani","year":"2022","journal-title":"Array"},{"key":"10.1016\/j.knosys.2026.116179_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.129117","article-title":"Online dynamic influence maximization based on deep reinforcement learning","volume":"618","author":"Song","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.knosys.2026.116179_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.comcom.2025.108045","article-title":"DCDIM: Diversified influence maximization on dynamic social networks","volume":"232","author":"Meena","year":"2025","journal-title":"Comput. Commun."},{"key":"10.1016\/j.knosys.2026.116179_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106600","article-title":"Competitive and complementary influence maximization in social network: A follower\u2019s perspective","volume":"213","author":"Huang","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116179_b9","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2020.09.002","article-title":"Maximizing positive influence in competitive social networks: A trust-based solution","volume":"546","author":"Wang","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.116179_b10","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ins.2022.11.041","article-title":"Targeted influence maximization in competitive social networks","volume":"619","author":"Liang","year":"2023","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.116179_b11","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.neunet.2023.10.030","article-title":"Balanced influence maximization in social networks based on deep reinforcement learning","volume":"169","author":"Yang","year":"2024","journal-title":"Neural Netw."},{"key":"10.1016\/j.knosys.2026.116179_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114813","article-title":"User-driven competitive influence maximization in social networks","volume":"1018","author":"Liu","year":"2024","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.knosys.2026.116179_b13","article-title":"Deep reinforcement learning with double q-learning","volume":"vol. 30","author":"Van Hasselt","year":"2016"},{"key":"10.1016\/j.knosys.2026.116179_b14","series-title":"Proceedings of the 40th International Conference on Machine Learning","first-page":"21350","article-title":"Deep graph representation learning and optimization for influence maximization","volume":"vol. 202","author":"Ling","year":"2023"},{"key":"10.1016\/j.knosys.2026.116179_b15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s13278-024-01311-z","article-title":"Learning graph representations for influence maximization","volume":"14","author":"Panagopoulos","year":"2024","journal-title":"Soc. Netw. Anal. Min."},{"key":"10.1016\/j.knosys.2026.116179_b16","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs","year":"2014"},{"key":"10.1016\/j.knosys.2026.116179_b17","series-title":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data","first-page":"75","article-title":"Influence maximization: near-optimal time complexity meets practical efficiency","author":"Tang","year":"2014"},{"key":"10.1016\/j.knosys.2026.116179_b18","series-title":"Proceedings of the 2016 International Conference on Management of Data","first-page":"695","article-title":"Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks","author":"Nguyen","year":"2016"},{"key":"10.1016\/j.knosys.2026.116179_b19","series-title":"Proceedings of the 2018 International Conference on Management of Data","first-page":"991","article-title":"Online processing algorithms for influence maximization","author":"Tang","year":"2018"},{"key":"10.1016\/j.knosys.2026.116179_b20","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"3","key":"10.1016\/j.knosys.2026.116179_b21","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","article-title":"PIANO: Influence maximization meets deep reinforcement learning","volume":"10","author":"Li","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"2","key":"10.1016\/j.knosys.2026.116179_b22","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","article-title":"ToupleGDD: A fine-designed solution of influence maximization by deep reinforcement learning","volume":"11","author":"Chen","year":"2024","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.knosys.2026.116179_b23","doi-asserted-by":"crossref","first-page":"129372","DOI":"10.1109\/ACCESS.2025.3590835","article-title":"Dynamic adaptive parametric social network analysis using reinforcement learning: A case study in topic-aware influence maximization","volume":"13","author":"Ahmadikia","year":"2025","journal-title":"IEEE Access"},{"key":"10.1016\/j.knosys.2026.116179_b24","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","article-title":"Influence maximization in social networks using graph embedding and graph neural network","volume":"607","author":"Kumar","year":"2022","journal-title":"Inform. Sci."},{"key":"10.1016\/j.knosys.2026.116179_b25","series-title":"Complex Networks VI","first-page":"91","article-title":"Selecting seed nodes for influence maximization in dynamic networks","author":"Osawa","year":"2015"},{"key":"10.1016\/j.knosys.2026.116179_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-018-0056-8","article-title":"Extended methods for influence maximization in dynamic networks","volume":"5","author":"Murata","year":"2018","journal-title":"Comput. Soc. Netw."},{"key":"10.1016\/j.knosys.2026.116179_b27","series-title":"Advances in Social Network Mining and Analysis: Second International Workshop","first-page":"55","article-title":"Finding spread blockers in dynamic networks","author":"Habiba","year":"2010"},{"key":"10.1016\/j.knosys.2026.116179_b28","series-title":"Efficient Influence Maximization in Social Networks","first-page":"199","author":"Chen","year":"2009"},{"issue":"7563","key":"10.1016\/j.knosys.2026.116179_b29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.knosys.2026.116179_b30","series-title":"Computational Science \u2013 ICCS 2020","first-page":"277","article-title":"Entropy-based measure for influence maximization in temporal networks","author":"Michalski","year":"2020"},{"key":"10.1016\/j.knosys.2026.116179_b31","series-title":"GNN-based candidate node predictor for influence maximization in temporal graphs","author":"Gautam","year":"2025"},{"key":"10.1016\/j.knosys.2026.116179_b32","series-title":"Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings 3","first-page":"306","article-title":"Competitive influence maximization in social networks","author":"Bharathi","year":"2007"},{"key":"10.1016\/j.knosys.2026.116179_b33","series-title":"Proceedings of the 20th International Conference on World Wide Web","first-page":"665","article-title":"Limiting the spread of misinformation in social networks","author":"Budak","year":"2011"},{"key":"10.1016\/j.knosys.2026.116179_b34","first-page":"12923","article-title":"Fully dynamic algorithm for constrained submodular optimization","volume":"vol. 33","author":"Lattanzi","year":"2020"},{"key":"10.1016\/j.knosys.2026.116179_b35","series-title":"International Conference on Machine Learning","first-page":"1204","article-title":"Graphnorm: A principled approach to accelerating graph neural network training","author":"Cai","year":"2021"},{"issue":"7540","key":"10.1016\/j.knosys.2026.116179_b36","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"Mnih","year":"2015","journal-title":"Nature"},{"issue":"3","key":"10.1016\/j.knosys.2026.116179_b37","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"10.1016\/j.knosys.2026.116179_b38","series-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"420","article-title":"Cost-effective outbreak detection in networks","author":"Leskovec","year":"2007"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126009056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126009056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T01:12:43Z","timestamp":1780017163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126009056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":38,"alternative-id":["S0950705126009056"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116179","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"D2G-DCIM: A deep reinforcement learning and graph neural network-driven model for dynamic competitive influence maximization","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116179","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116179"}}