{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:25:50Z","timestamp":1742959550564,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030970987"},{"type":"electronic","value":"9783030970994"}],"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-030-97099-4_4","type":"book-chapter","created":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T11:03:15Z","timestamp":1646218995000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness and Algorithms for Electoral Manipulation Under Media Influence"],"prefix":"10.1007","author":[{"given":"Liangde","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shouhuai","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhimin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dian","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, New York (2016)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ic.2016.08.003","volume":"251","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., Niedermeier, R.: Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251, 140\u2013164 (2016)","journal-title":"Inf. Comput."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., Talmon, N.: Complexity of shift bribery in committee elections. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, pp. 2452\u20132458 (2016)","DOI":"10.1609\/aaai.v30i1.10132"},{"key":"4_CR4","unstructured":"Brelsford, E., Faliszewski, P., Hemaspaandra, E., Schnoor, H., Schnoor, I.: Approximability of manipulating elections. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, vol. 1, pp. 44\u201349 (2008)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Castiglioni, M., Ferraioli, D., Gatti, N.: Election control in social networks via edge addition or removal. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, pp. 1878\u20131885 (2020)","DOI":"10.1609\/aaai.v34i02.5556"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2390176.2390185","volume":"9","author":"C Chekuri","year":"2012","unstructured":"Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multicover problem in geometric settings. ACM Trans. Algorithms 9(1), 1\u201317 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR7","unstructured":"Chen, L., et al.: Protecting election from bribery: new approach and computational complexity characterization. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems, pp. 1894\u20131896 (2018)"},{"key":"4_CR8","unstructured":"Cor\u00f2, F., Cruciani, E., D\u2019Angelo, G., Ponziani, S.: Vote for me! Election control via social influence in arbitrary scoring rule voting systems. In: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems, pp. 1895\u20131897 (2019)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Internet and Network Economics, pp. 473\u2013482 (2010)","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Proceedings of the 2nd International Symposium on Algorithmic Game Theory, pp. 299\u2013310 (2009)","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Gonen, R., Kouteck\u1ef3, M., Talmon, N.: Opinion diffusion and campaigning on society graphs. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 219\u2013225 (2018)","DOI":"10.24963\/ijcai.2018\/30"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1613\/jair.3136","volume":"40","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: Multimode control attacks on elections. J. Artif. Intell. Res. 40, 305\u2013351 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR14","unstructured":"Faliszewski, P., Reisch, Y., Rothe, J., Schend, L.: Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 1357\u20131358 (2014)"},{"key":"4_CR15","unstructured":"Fowler, E.F., Franz, M., Ridout, T.N.: The big lessons of political advertising in 2018. The Conversation (2018). http:\/\/theconversation.com\/the-big-lessons-of-political-advertising-in-2018-107673. Accessed 3 Dec"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jda.2005.07.005","volume":"4","author":"J Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. J. Discrete Algorithms 4(4), 608\u2013622 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Hua, Q.S., Yu, D., Lau, F.C., Wang, Y.: Exact algorithms for set multicover and multiset multicover problems. In: Proceedings of the 20th International Symposium on Algorithms and Computation, pp. 34\u201344 (2009)","DOI":"10.1007\/978-3-642-10631-6_6"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Lin, B.: The parameterized complexity of k-biclique. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 605\u2013615 (2014)","DOI":"10.1137\/1.9781611973730.41"},{"issue":"10","key":"4_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.3390\/a13100251","volume":"13","author":"MA Mehrizi","year":"2020","unstructured":"Mehrizi, M.A., D\u2019Angelo, G.: Multi-winner election control via social influence: hardness and algorithms for restricted cases. Algorithms 13(10), 251 (2020)","journal-title":"Algorithms"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Parkes, D.C., Xia, L.: A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1429\u20131435 (2012)","DOI":"10.1609\/aaai.v26i1.8258"},{"issue":"10","key":"4_CR21","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ipl.2015.03.004","volume":"115","author":"R Van Bevern","year":"2015","unstructured":"Van Bevern, R., Chen, J., H\u00fcffner, F., Kratsch, S., Talmon, N., Woeginger, G.J.: Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10), 744\u2013749 (2015)","journal-title":"Inf. Process. Lett."},{"key":"4_CR22","unstructured":"Wilder, B., Vorobeychik, Y.: Controlling elections through social influence. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems, pp. 265\u2013273 (2018)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 982\u2013999 (2012)","DOI":"10.1145\/2229012.2229086"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97099-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T06:08:02Z","timestamp":1674886082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97099-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030970987","9783030970994"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97099-4_4","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":"3 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/econcs.pku.edu.cn\/ijtcs2021\/CFP_G.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":"EasyCHair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","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":"5","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":"56% - 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":"2","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)"}}]}}