{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:08:58Z","timestamp":1742951338543,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_7","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"85-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computational Complexity Characterization of Protecting Elections from Bribery"],"prefix":"10.1007","author":[{"given":"Lin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ahmed","family":"Sunny","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Shouhuai","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhimin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Nolan","family":"Shah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"7_CR1","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."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.ipl.2015.09.008","volume":"116","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Talmon, N.: NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting. Inf. Process. Lett. 116(2), 147\u2013152 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/130906593","volume":"24","author":"A Caprara","year":"2014","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A study on the computational complexity of the bilevel knapsack problem. SIAM J. Optim. 24(2), 823\u2013838 (2014)","journal-title":"SIAM J. Optim."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1613\/jair.5515","volume":"60","author":"J Chen","year":"2017","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Elections with few voters: candidate control can be easy. J. Artif. Intell. Res. 60, 937\u20131002 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR5","unstructured":"Chen, L., et al.: Computational complexity characterization of protecting elections from bribery. arXiv preprint arXiv:2007.02533 (2020)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.08.008","volume":"497","author":"L Chen","year":"2013","unstructured":"Chen, L., Zhang, G.: Approximation algorithms for a bi-level knapsack problem. Theor. Comput. Sci. 497, 1\u201312 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2017.02.031","volume":"676","author":"P Dey","year":"2017","unstructured":"Dey, P., Misra, N., Narahari, Y.: Frugal bribery in voting. Theor. Comput. Sci. 676, 15\u201332 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: The complexity of bribery and control in group identification. Auton. Agent Multi-Agent Syst. 34(1) (2019). Article number: 8. https:\/\/doi.org\/10.1007\/s10458-019-09427-9","DOI":"10.1007\/s10458-019-09427-9"},{"key":"7_CR9","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":"7_CR10","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1613\/jair.4621","volume":"52","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: Weighted electoral control. J. Artif. Intell. Res. 52, 507\u2013542 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR11","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: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 146\u2013168. Cambridge University Press, Cambridge (2016)"},{"key":"7_CR12","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Schnoor, H.: A control dichotomy for pure scoring rules. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, Qu\u00e9bec City, Qu\u00e9bec, Canada, 27\u201331 July 2014, pp. 712\u2013720. AAAI Press (2014)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10458-019-09403-3","volume":"33","author":"A Kaczmarczyk","year":"2019","unstructured":"Kaczmarczyk, A., Faliszewski, P.: Algorithms for destructive shift bribery. Auton. Agent. Multi-Agent Syst. 33(3), 275\u2013297 (2019). https:\/\/doi.org\/10.1007\/s10458-019-09403-3","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"7_CR14","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Voting and bribing in single-exponential time. In: Vollmer, H., Vall\u00e9e, B. (eds.) 34th STACS, STACS 2017. LIPIcs, Hannover, Germany, 8\u201311 March 2017, vol. 66, pp. 46:1\u201346:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"7_CR15","unstructured":"Lin, A.: The complexity of manipulating k-approval elections. In: Filipe, J., Fred, A.L.N. (eds.) ICAART 2011 - Proceedings of the 3rd ICAART, Volume 2 - Agents, Rome, Italy, 28\u201330 January 2011, pp. 212\u2013218. SciTePress (2011)"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1109\/TIT.1984.1056978","volume":"30","author":"AM McLoughlin","year":"1984","unstructured":"McLoughlin, A.M.: The complexity of computing the covering radius of a code. IEEE Trans. Inf. Theory 30(6), 800\u2013804 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.tcs.2015.06.027","volume":"595","author":"X Qiu","year":"2015","unstructured":"Qiu, X., Kern, W.: Improved approximation algorithms for a bilevel knapsack problem. Theor. Comput. Sci. 595, 120\u2013129 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"7\u20139","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1016\/j.tcs.2009.12.002","volume":"411","author":"Z Wang","year":"2010","unstructured":"Wang, Z., Xing, W., Fang, S.: Two-group knapsack game. Theor. Comput. Sci. 411(7\u20139), 1094\u20131103 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR19","unstructured":"Yin, Y., Vorobeychik, Y., An, B., Hazon, N.: Optimally protecting elections. In: Kambhampati, S. (ed.) Proceedings of the 25th IJCAI, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 538\u2013545. IJCAI\/AAAI Press (2016)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:34:09Z","timestamp":1619242449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}