{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:00Z","timestamp":1742914260845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_11","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"116-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Competition-Based Generalized Self-profit Maximization in\u00a0Dual-Attribute Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4553-3762","authenticated-orcid":false,"given":"Liman","family":"Du","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"11_CR1","unstructured":"Chen, T., Guo, J., Wu, W.: Adaptive multi-feature budgeted profit maximization in social networks (2020). https:\/\/arxiv.org\/abs\/2006.03222"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795\u2013804. ACM, San Francisco California USA (2016). https:\/\/doi.org\/10.1145\/2939672.2939745","DOI":"10.1145\/2939672.2939745"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Du, L., Chen, S., Gao, S., Yang, W.: Nonsubmodular constrained profit maximization from increment perspective. J. Comb. Optim. https:\/\/doi.org\/10.1007\/s10878-021-00774-6","DOI":"10.1007\/s10878-021-00774-6"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-92681-6_27","volume-title":"Combinatorial Optimization and Applications","author":"L Du","year":"2021","unstructured":"Du, L., Yang, W., Gao, S.: Generalized self-profit maximization in\u00a0attribute networks. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) COCOA 2021. LNCS, vol. 13135, pp. 333\u2013347. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_27"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Feige, U., Izsak, R.: Welfare maximization and the supermodular degree. In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS \u201913, p. 247. ACM Press, Berkeley, California, USA (2013). https:\/\/doi.org\/10.1145\/2422436.2422466","DOI":"10.1145\/2422436.2422466"},{"key":"11_CR6","unstructured":"Feldman, M., Izsak, R.: Constrained monotone function maximization and the supermodular degree (2014). https:\/\/arxiv.org\/abs\/1407.6328v2"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Guo, J., Chen, T., Wu, W.: A multi-feature diffusion model: rumor blocking in social networks. In: IEEE\/ACM Transactions on Networking, pp. 1\u201312 (2020). https:\/\/doi.org\/10.1109\/TNET.2020.3032893","DOI":"10.1109\/TNET.2020.3032893"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"He, X., Kempe, D.: Stability of influence maximization. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD \u201914, pp. 1256\u20131265. ACM Press, New York, New York, USA (2014). https:\/\/doi.org\/10.1145\/2623330.2623746","DOI":"10.1145\/2623330.2623746"},{"key":"11_CR9","unstructured":"Iyer, R., Jegelka, S., Bilmes, J.: Curvature and optimal algorithms for learning and minimizing submodular functions (2013). https:\/\/arxiv.org\/abs\/1311.2110"},{"key":"11_CR10","unstructured":"Iyer, R.K., Bilmes, J.A.: Submodular optimization with submodular cover and submodular knapsack constraints (2013). https:\/\/arxiv.org\/abs\/1311.2106"},{"key":"11_CR11","unstructured":"Iyer, R.K., Bilmes, J.A.: Algorithms for approximate minimization of the difference between submodular functions, with applications (2014). https:\/\/arxiv.org\/abs\/1408.2051"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 37\u2013146 (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Kunegis, J.: KONECT - The Koblenz network collection. In: Proceedings of the International Conference on World Wide Web Companion, pp. 1343\u20131350 (2013). https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015). https:\/\/doi.org\/10.14778\/2850578.2850581","journal-title":"Proc. VLDB Endow."},{"key":"11_CR15","unstructured":"Narasimhan, M., Bilmes, J.A.: A submodular-supermodular procedure with applications to discriminative structure learning (2012). https:\/\/arxiv.org\/abs\/1207.1404"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 8(1), 130\u2013147 (2011). https:\/\/doi.org\/10.1109\/TASE.2010.2052042","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-030-93176-6_21","volume-title":"Algorithmic Aspects in Information and Management","author":"Q Ni","year":"2021","unstructured":"Ni, Q., Guo, J., Du, H.W.: Multi-attribute based influence maximization in\u00a0social networks. In: Wu, W., Du, H. (eds.) AAIM 2021. LNCS, vol. 13153, pp. 240\u2013251. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93176-6_21"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang, J., Zhou, S., Li, X., Liu, L., Wu, H.: Cofim: a community-based framework for influence maximization on large-scale networks. Knowl. Based Syst. 117, 88\u2013100 (2017). https:\/\/doi.org\/10.1016\/j.knosys.2016.09.029","journal-title":"Knowl. Based Syst."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Towards profit maximization for online social network providers (2017). https:\/\/arxiv.org\/abs\/1712.08963","DOI":"10.1109\/INFOCOM.2018.8485975"},{"issue":"6","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TKDE.2017.2787757","volume":"30","author":"J Tang","year":"2018","unstructured":"Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans. Knowl. Data Eng. 30(6), 1095\u20131108 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2787757","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"11_CR21","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Yang, Y., Pei, J., Chu, L., Chen, E.: Activity maximization by effective information diffusion in social networks. IEEE Trans. Knowl. Data Eng. 29(11), 2374\u20132387 (2017). https:\/\/doi.org\/10.1109\/TKDE.2017.2740284","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Wu, W.L., Zhang, Z., Du, D.Z.: Set function optimization. J. Oper. Res. Soc. China 7 (2018). https:\/\/doi.org\/10.1007\/s40305-018-0233-3","DOI":"10.1007\/s40305-018-0233-3"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:22:52Z","timestamp":1672550572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"0","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":"44% - 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":"7","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)"}}]}}