{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:29:20Z","timestamp":1762298960732,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T00:00:00Z","timestamp":1550534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007751","name":"Akademia G\u00f3rniczo-Hutnicza im. Stanislawa Staszica","doi-asserted-by":"publisher","award":["AGH University grant 11.11.230.124 (statutory research)","AGH University grant 11.11.230.124 (statutory research)"],"award-info":[{"award-number":["AGH University grant 11.11.230.124 (statutory research)","AGH University grant 11.11.230.124 (statutory research)"]}],"id":[{"id":"10.13039\/501100007751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["AFFA (BR 5207\/1 and NI 369\/15)"],"award-info":[{"award-number":["AFFA (BR 5207\/1 and NI 369\/15)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10458-019-09403-3","type":"journal-article","created":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T14:44:07Z","timestamp":1550587447000},"page":"275-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Algorithms for destructive shift bribery"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1401-0157","authenticated-orcid":false,"given":"Andrzej","family":"Kaczmarczyk","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Baumeister, D., Erd\u00e9lyi, G., & Rothe, J. (2011). How hard is it to bribe judges? A study of the complexity of bribery in judgement aggregation. In Proceedings of the 2nd international conference on algorithmic decision theory (pp. 1\u201315).","key":"9403_CR1","DOI":"10.1007\/978-3-642-24873-3_1"},{"unstructured":"Baumeister, D., Faliszewski, P., Lang, J., & Rothe, J. (2012). Campaigns for lazy voters: Truncated ballots. In Proceedings of the 11th international conference on autonomous agents and multiagent systems (pp. 577\u2013584).","key":"9403_CR2"},{"key":"9403_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2013.10.003","volume":"11","author":"D Binkele-Raible","year":"2014","unstructured":"Binkele-Raible, D., Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., & Rothe, J. (2014). The complexity of probabilistic lobbying. Discrete Optimization, 11, 1\u201321.","journal-title":"Discrete Optimization"},{"key":"9403_CR4","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. (2016). Prices matter for the parameterized complexity of shift bribery. Information and Computation, 251, 140\u2013164.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R., Skowron, P., & Talmon, N. (2017). Robustness among multiwinner voting rules. In Proceedings of the 10th international symposium on algorithmic game theory (pp. 80\u201392).","key":"9403_CR5","DOI":"10.1007\/978-3-319-66700-3_7"},{"key":"9403_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1613\/jair.4927","volume":"55","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Faliszewski, P., Niedermeier, R., & Talmon, N. (2016). Large-scale election campaigns: Combinatorial shift bribery. Journal of Artificial Intelligence Research, 55, 603\u2013652.","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Cary, D. (2011). Estimating the margin of victory for instant-runoff voting. Presented at the 2011 Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections","key":"9403_CR7"},{"issue":"3","key":"9403_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., & Slinko, A. (2007). On complexity of lobbying in multiple referenda. Review of Economic Design, 11(3), 217\u2013224.","journal-title":"Review of Economic Design"},{"doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., & Lang, J. (2007). When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3), Article 14.","key":"9403_CR9","DOI":"10.1145\/1236457.1236461"},{"key":"9403_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms. Berlin: Springer."},{"unstructured":"Dey, P., & Narahari, Y. (2015). Estimating the margin of victory of an election using sampling. In Proceedings of the 24th international joint conference on artificial intelligence (pp. 1120\u20131126).","key":"9403_CR11"},{"issue":"3\u20134","key":"9403_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10472-015-9469-3","volume":"77","author":"B Dorn","year":"2016","unstructured":"Dorn, B., & Kr\u00fcger, D. (2016). On the hardness of bribery variants in voting with CP-nets. Annals of Mathematics and Artificial Intelligence, 77(3\u20134), 251\u2013279.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"9403_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., & Schlotter, I. (2012). Multivariate complexity analysis of swap bribery. Algorithmica, 64(1), 126\u2013151.","journal-title":"Algorithmica"},{"key":"9403_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R. G., & Fellows, M. R. (1995). Fixed-parameter tractability and completeness II: On completeness for $$W$$ W [1]. Theoretical Computer Science, 141, 109\u2013131.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Elkind, E., & Faliszewski, P. (2010). Approximation algorithms for campaign management. In Proceedings of the 6th international workshop on internet and network economics (pp. 473\u2013482).","key":"9403_CR15","DOI":"10.1007\/978-3-642-17572-5_40"},{"doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., & Slinko, A. (2009). Swap bribery. In Proceedings of the 2nd international symposium on algorithmic game theory (pp. 299\u2013310).","key":"9403_CR16","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"9403_CR17","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. (2009). How hard is bribery in elections? Journal of Artificial Intelligence Research, 35, 485\u2013532.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9403_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2009). Llull and Copeland voting computationally resist bribery and constructive control. Journal of Artificial Intelligence Research, 35, 275\u2013341.","journal-title":"Journal of Artificial Intelligence Research"},{"doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Manurangsi, P., & Sornat, K. (2019). Approximation and hardness of shift-bribery. In Proceedings of the 33rd AAAI conference on artificial intelligence (To appear).","key":"9403_CR19","DOI":"10.1609\/aaai.v33i01.33011901"},{"issue":"6","key":"9403_CR20","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s10458-014-9277-x","volume":"29","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Reisch, Y., Rothe, J., & Schend, L. (2015). Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Autonomous Agents and Multiagent Systems, 29(6), 1091\u20131124.","journal-title":"Autonomous Agents and Multiagent Systems"},{"key":"9403_CR21","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. (2016). Control and bribery in voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice (pp. 146\u2013168). Cambridge: Cambridge University Press."},{"key":"9403_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M. R., Hermelin, D., Rosamond, F., & Vialette, S. (2009). On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science, 410, 53\u201361.","journal-title":"Theoretical Computer Science"},{"unstructured":"Hazon, N., Lin, R., & Kraus, S. (2013). How to change a group\u2019s collective decision? In Proceedings of the 23rd international joint conference on artificial intelligence (pp. 198\u2013205).","key":"9403_CR23"},{"issue":"5\u20136","key":"9403_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., & Rothe, J. (2007). Anyone but him: The complexity of precluding an alternative. Artificial Intelligence, 171(5\u20136), 255\u2013285.","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Karp, R. (1972). Reducibilities among combinatorial problems. In Proceedings of a Symposium on the Complexity of Computer Computations (pp. 85\u2013103).","key":"9403_CR25","DOI":"10.1007\/978-1-4684-2001-2_9"},{"unstructured":"Knop, D., Kouteck\u00fd, M., & Mnich, M. (2017). Voting and bribing in single-exponential time. In Proceedings of the 34th symposium on theoretical aspects of computer science (pp. 46:1\u201346:14).","key":"9403_CR26"},{"unstructured":"Knop, D., Kouteck\u00fd, M., & Mnich, M. (2018). A unifying framework for manipulation problems. In Proceedings of the 17th international conference on autonomous agents and multiagent systems (pp. 256\u2013264).","key":"9403_CR27"},{"unstructured":"Magrino, T., Rivest, R., Shen, E., & Wagner, D. (2011). Computing the margin of victory in IRV elections. Presented at 2011 Electronic Voting Technology Workshop\/Workshop on Trushworthy Elections","key":"9403_CR28"},{"doi-asserted-by":"crossref","unstructured":"Maran, A., Maudet, N., Pini, M., Rossi, F., & Venable, K. (2013). A framework for aggregating influenced CP-nets and its resistance to bribery. In Proceedings of the 27th AAAI conference on artificial intelligence (pp. 668\u2013674).","key":"9403_CR29","DOI":"10.1609\/aaai.v27i1.8639"},{"issue":"1\u20133","key":"9403_CR30","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10472-013-9330-5","volume":"68","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Pini, M., Rossi, F., & Venable, K. (2013). Bribery in voting with CP-nets. Annals of Mathematics and Artificial Intelligence, 68(1\u20133), 135\u2013160.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Mattei, N., & Walsh, T. (2013). Preflib: A library for preferences. In Proceedings of the 3rd international conference on algorithmic decision theory (pp. 259\u2013270).","key":"9403_CR31","DOI":"10.1007\/978-3-642-41575-3_20"},{"unstructured":"Maushagen, C., Nevelling, M., Rothe, J., & Selker, A. (2018). Complexity of shift bribery in iterative elections. In Proceedings of the 17th international conference on autonomous agents and multiagent systems (pp. 1567\u20131575).","key":"9403_CR32"},{"doi-asserted-by":"crossref","unstructured":"Nehama, I. (2015). Complexity of optimal lobbying in threshold aggregation. In Proceedings of the 4th international conference on algorithmic decision theory (pp. 379\u2013395).","key":"9403_CR33","DOI":"10.1007\/978-3-319-23114-3_23"},{"key":"9403_CR34","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R. (2006). Invitation to fixed-parameter algorithms. Oxford: Oxford University Press."},{"unstructured":"Obraztsova, S., & Elkind, E. (2011). On the complexity of voting manipulation under randomized tie-breaking. In Proceedings of the 22nd international joint conference on artificial intelligence (pp. 319\u2013324).","key":"9403_CR35"},{"unstructured":"Obraztsova, S., Elkind, E., & Hazon, N. (2011). Ties matter: Complexity of voting manipulation revisited. In Proceedings of the 10th international conference on autonomous agents and multiagent systems (pp. 71\u201378).","key":"9403_CR36"},{"key":"9403_CR37","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H. (1994). Computational complexity. Boston: Addison-Wesley."},{"key":"9403_CR38","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"4","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K. (2003). On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences, 4, 757\u2013771.","journal-title":"Journal of Computer and System Sciences"},{"key":"9403_CR39","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/s00453-015-0064-0","volume":"77","author":"I Schlotter","year":"2017","unstructured":"Schlotter, I., Faliszewski, P., & Elkind, E. (2017). Campaign management under approval-driven voting rules. Algorithmica, 77, 84\u2013115.","journal-title":"Algorithmica"},{"unstructured":"Shiryaev, D., Yu, L., & Elkind, E. (2013). On elections with robust winners. In Proceedings of the 12th international conference on autonomous agents and multiagent systems (pp. 415\u2013422).","key":"9403_CR40"},{"doi-asserted-by":"crossref","unstructured":"Xia, L. (2012). Computing the margin of victory for various voting rules. In Proceedings of the 13th ACM conference on electronic commerce (pp. 982\u2013999).","key":"9403_CR41","DOI":"10.1145\/2229012.2229086"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-019-09403-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09403-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-019-09403-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T03:10:04Z","timestamp":1662952204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-019-09403-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,19]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["9403"],"URL":"https:\/\/doi.org\/10.1007\/s10458-019-09403-3","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2019,2,19]]},"assertion":[{"value":"19 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}