{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:09Z","timestamp":1743049629281,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031185298"},{"type":"electronic","value":"9783031185304"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18530-4_21","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:30Z","timestamp":1668985350000},"page":"287-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pervasive Domination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9148-9769","authenticated-orcid":false,"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3459-1075","authenticated-orcid":false,"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9124-610X","authenticated-orcid":false,"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1037\/h0093718","volume":"70","author":"SE Asch","year":"1956","unstructured":"Asch, S.E.: Studies of independence and conformity: a minority of one against a unanimous majority. Psychol. Monogr. 70, 1 (1956)","journal-title":"Psychol. Monogr."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-24873-3_1","volume-title":"Algorithmic Decision Theory","author":"D Baumeister","year":"2011","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Rothe, J.: How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation. In: Brafman, R.I., Roberts, F.S., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 1\u201315. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24873-3_1"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989). https:\/\/doi.org\/10.1007\/BF00295861","journal-title":"Soc. Choice Welf."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cobeha.2015.01.007","volume":"3","author":"CN Cascio","year":"2015","unstructured":"Cascio, C.N., Scholz, C., Falk, E.B.: Social influence and the brain: persuasion, susceptibility to influence and retransmission. Curr. Opin. Behav. Sci. 3, 51\u201357 (2015)","journal-title":"Curr. Opin. Behav. Sci."},{"key":"21_CR5","unstructured":"Cellinese, F., D\u2019Angelo, G., Monaco, G., Velaj, Y.: Generalized budgeted submodular set function maximization. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), LIPIcs, vol. 117, pp. 31:1\u201331:14 (2018)"},{"key":"21_CR6","volume-title":"Connected: The Surprising Power of Our Social Networks and How They Shape Our Lives","author":"NA Christakis","year":"2011","unstructured":"Christakis, N.A., Fowler, J.H.: Connected: The Surprising Power of Our Social Networks and How They Shape Our Lives. Brown and Co. Little, Boston (2011)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.dam.2012.10.007","volume":"161","author":"F Cicalese","year":"2013","unstructured":"Cicalese, F., Milanic, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. 161, 750\u2013767 (2013)","journal-title":"Discret. Appl. Math."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s13278-016-0408-z","volume":"6","author":"G Cordasco","year":"2016","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6, 94 (2016)","journal-title":"Soc. Netw. Anal. Min."},{"key":"21_CR9","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Threshold-bounded dominating set with incentives. In: Proceeding of ICTCS 2018, CEUR Workshop Proceedings, pp. 65\u201376 (2018)"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/net.21756","volume":"71","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Evangelism in social networks: algorithms and complexity. Networks 71(4), 346\u2013357 (2018)","journal-title":"Networks"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-030-25005-8_14","volume-title":"Combinatorial Algorithms","author":"G Cordasco","year":"2019","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Dual domination. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 160\u2013174. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_14"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2018.02.024","volume":"764","author":"G Cordasco","year":"2019","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Active influence spreading in social networks. Theoret. Comput. Sci. 764, 15\u201329 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2018.05.030","volume":"810","author":"G Cordasco","year":"2020","unstructured":"Cordasco, G., et al.: Whom to befriend to influence people. Theoret. Comput. Sci. 810, 26\u201342 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2019.07.007","volume":"812","author":"G Cordasco","year":"2020","unstructured":"Cordasco, G., Gargano, L., Peters, J.G., Rescigno, A.A., Vaccaro, U.: Fast and frugal targeting with incentives. Theoret. Comput. Sci. 812, 62\u201379 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-26626-8_15","volume-title":"Combinatorial Optimization and Applications","author":"G Cordasco","year":"2015","unstructured":"Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: A fast and effective heuristic for discovering small target sets in social networks. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 193\u2013208. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_15"},{"key":"21_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1017\/CBO9781107446984.008","volume-title":"Handbook of Computational Social Choice","author":"P Faliszewski","year":"2016","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Moulin, H., Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, pp. 146\u2013168. Cambridge University Press, Cambridge (2016)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-03578-9_12","volume-title":"Structural Information and Communication Complexity","author":"L Gargano","year":"2013","unstructured":"Gargano, L., Hell, P., Peters, J., Vaccaro, U.: Influence diffusion in social networks under time window constraints. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 141\u2013152. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03578-9_12"},{"key":"21_CR19","unstructured":"Grandi, U., Turrini, P.: A network-based rating system and its resistance to bribery. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 301\u2013307 (2016)"},{"key":"21_CR20","series-title":"Pure and Applied Mathematics (Marcel Dekker)","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Pure and Applied Mathematics (Marcel Dekker), CRC, Boca Raton (1998)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Hui, P., Buchegger, S.: Groupthink and peer pressure: social influence in online social network groups. In: 2009 International Conference on Advances in Social Network Analysis and Mining, pp. 53\u201359. IEEE (2009)","DOI":"10.1109\/ASONAM.2009.17"},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1111\/j.1468-2958.2010.01390.x","volume":"36","author":"D Huffaker","year":"2010","unstructured":"Huffaker, D.: Dimensions of leadership and social influence in online communities. Hum. Commun. Res. 36(4), 593\u2013617 (2010)","journal-title":"Hum. Commun. Res."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Pruksachatkun, Y., Pendse, S.R., Sharma, A.: Moments of change: analyzing peer based cognitive support in online mental health forums. In: Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems (CHI2019), Glasgow (2019)","DOI":"10.1145\/3290605.3300294"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10878-016-0005-0","volume":"33","author":"Y Ran","year":"2017","unstructured":"Ran, Y., Zhang, Z., Du, H., Zhu, Y.: Approximation algorithm for partial positive influence problem in social network. J. Comb. Optim. 33, 791\u2013802 (2017). https:\/\/doi.org\/10.1007\/s10878-016-0005-0","journal-title":"J. Comb. Optim."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Ratkiewicz, J., et al.: Truthy: mapping the spread of astroturf in microblog streams. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 249\u2013252. ACM (2011)","DOI":"10.1145\/1963192.1963301"},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385\u2013393 (1982). https:\/\/doi.org\/10.1007\/BF02579435","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18530-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:03:55Z","timestamp":1668985435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18530-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031185298","9783031185304"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18530-4_21","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":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","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":"18 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isco2022.sciencesconf.org\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"24","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":"48% - 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":"4-5","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-5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}