{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T19:25:44Z","timestamp":1762543544697,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914301"},{"type":"electronic","value":"9783030914318"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91431-8_27","type":"book-chapter","created":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T16:13:29Z","timestamp":1637165609000},"page":"431-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multiple Agents Reinforcement Learning Based Influence Maximization in Social Network Services"],"prefix":"10.1007","author":[{"given":"Yiming","family":"Liu","sequence":"first","affiliation":[]},{"given":"Waichau","family":"Sze","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"6337","DOI":"10.1109\/ACCESS.2018.2888895","volume":"7","author":"K Ali","year":"2019","unstructured":"Ali, K., Wang, C., Chen, Y.: A novel nested Q-learning method to tackle time-constrained competitive influence maximization. IEEE Access 7, 6337\u20136352 (2019)","journal-title":"IEEE Access"},{"issue":"9","key":"27_CR2","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Jenamani, M., Pratihar, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62(9), 3417\u20133455 (2020). https:\/\/doi.org\/10.1007\/s10115-020-01461-4","journal-title":"Knowl. Inf. Syst."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Zhang, G., Cheng, X.: Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: The Conference on Information and Knowledge Management (CIKM), pp. 509\u2013518 (2013)","DOI":"10.1145\/2505515.2505541"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: International Conference on World Wide Web (WWW), pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11871637_27","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M Kimura","year":"2006","unstructured":"Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259\u2013271. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871637_27"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Vanbriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: International Conference on Knowledge Discovery and Data Mining (SIGKDD) (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"27_CR9","unstructured":"Li, H., Xu, M., Bhowmick, S.S., Sun, C., Jiang, Z., Cui, J.: Disco: influence maximization meets network embedding and deep learning. arXiv preprint arXiv:1906.07378 (2019)"},{"issue":"10","key":"27_CR10","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. (TKDE) 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"issue":"7540","key":"27_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015)","journal-title":"Nature"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: International Conference on Management of Data (SIGMOD), pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"12084","DOI":"10.1109\/ACCESS.2020.2966056","volume":"8","author":"L Qiu","year":"2020","unstructured":"Qiu, L., Gu, C., Zhang, S., Tian, X., Mingjv, Z.: TSIM: a two-stage selection algorithm for influence maximization in social networks. IEEE Access 8, 12084\u201312095 (2020)","journal-title":"IEEE Access"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: International Conference on Management of Data (SIGMOD), pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"27_CR16","unstructured":"Vaswani, S., Kveton, B., Wen, Z., Ghavamzadeh, M., Lakshmanan, L.V., Schmidt, M.: Model-independent online learning for influence maximization. In: International Conference on Machine Learning (ICML), pp. 3530\u20133539. PMLR (2017)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Wang, C., Liu, Y., Gao, X., Chen, G.: Reinforcement learning model for influence maximization in social networks. In: International Conference on Database Systems for Advanced Applications (DASFAA) (2021)","DOI":"10.1007\/978-3-030-73197-7_48"}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91431-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:06:42Z","timestamp":1637280402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91431-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914301","9783030914318"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91431-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icsoc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"189","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}