{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:37Z","timestamp":1762101757778,"version":"3.41.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T00:00:00Z","timestamp":1441152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council (BE)","doi-asserted-by":"publisher","award":["StG 639945"],"award-info":[{"award-number":["StG 639945"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"National Research Foundation-Prime Minister\u2019s office, Republic of Singapore (SG)","doi-asserted-by":"publisher","award":["NRF RF2009-08"],"award-info":[{"award-number":["NRF RF2009-08"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hungarian National Research Fund","award":["108383 and 108947"],"award-info":[{"award-number":["108383 and 108947"]}]},{"name":"Polish Ministry of Science and Higher Education","award":["N-N206-378637"],"award-info":[{"award-number":["N-N206-378637"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00453-015-0064-0","type":"journal-article","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T18:45:10Z","timestamp":1441133110000},"page":"84-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Campaign Management Under Approval-Driven Voting Rules"],"prefix":"10.1007","volume":"77","author":[{"given":"Ildiko","family":"Schlotter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edith","family":"Elkind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,2]]},"reference":[{"issue":"4","key":"64_CR1","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"4","key":"64_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J Bartholdi III","year":"1986","unstructured":"Bartholdi III, J., Trick, M.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5(4), 165\u2013169 (1986)","journal-title":"Oper. Res. Lett."},{"key":"64_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-642-02839-7_10","volume-title":"Handbook of Approval Voting","author":"D Baumeister","year":"2010","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Computational aspects of approval voting. In: Laslier, J., Sanver, R. (eds.) Handbook of Approval Voting, pp. 199\u2013251. Springer, Berlin (2010)"},{"key":"64_CR4","unstructured":"Baumeister, D., Faliszewski, P., Lang, J., Rothe, J.: Campaigns for lazy voters: truncated ballots. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, pp. 577\u2013584 (2012)"},{"key":"64_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47, 475\u2013519 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"64_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.electstud.2005.05.007","volume":"25","author":"S Brams","year":"2006","unstructured":"Brams, S., Sanver, R.: Critical strategies under approval voting: who gets ruled in and ruled out. Elect. Stud. 25(2), 287\u2013305 (2006)","journal-title":"Elect. Stud."},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Brams, S., Sanver, R.: Voting systems that combine approval and preference. In: Brams, S., Gehrlein, W. V., Roberts, F. S. (eds.) The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn, pp. 215\u2013237. Springer, Berlin (2009)","DOI":"10.1007\/978-3-540-79128-7_12"},{"key":"64_CR8","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1613\/jair.4647","volume":"53","author":"F Brandt","year":"2015","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.: Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates. J. Artif. Intell. Res. 53, 439\u2013496 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., Niedermeier, R.: Prices matter for the parameterized complexity of shift bribery. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 1398\u20131404 (2014)","DOI":"10.1609\/aaai.v28i1.8881"},{"key":"64_CR10","unstructured":"Bredereck, R., Chen, J., Woeginger, G.: Are there any nicely structured preference profiles nearby? In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 62\u201368 (2013)"},{"key":"64_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1613\/jair.2606","volume":"35","author":"V Conitzer","year":"2009","unstructured":"Conitzer, V.: Eliciting single-peaked preferences using comparison queries. J. Artif. Intell. Res. 35, 161\u2013191 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"64_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"J Doignon","year":"1994","unstructured":"Doignon, J., Falmagne, J.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"64_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64(1), 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"64_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Berlin (1999)"},{"issue":"2","key":"64_CR15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"64_CR16","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P.: Approximation algorithms for campaign management. In: Proceedings of the 6th International Workshop on Internet and Network Economics, Lecture Notes in Computer Science #6484, pp. 473\u2013482. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-17572-5_40"},{"key":"64_CR17","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Proceedings of the 2nd International Symposium on Algorithmic Game Theory, Lecture Notes in Computer Science #5814, pp. 299\u2013310. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04645-2_27"},{"key":"64_CR18","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. Technical Report arXiv:0905.3885 \u00a0[cs.GT], arXiv.org, May (2009)","DOI":"10.2139\/ssrn.1422183"},{"key":"64_CR19","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: On the role of distances in defining voting rules. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pp. 375\u2013382. International Foundation for Autonomous Agents and Multiagent Systems (2010)"},{"issue":"4","key":"64_CR20","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1016\/j.jcss.2014.11.002","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: a theoretical analysis. J. Comput. Syst. Sci. 81(4), 632\u2013660 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"64_CR21","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.jcss.2014.11.003","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M., Rothe, J., Schend, L.: Control complexity in Bucklin and fallback voting: an experimental analysis. J. Comput. Syst. Sci. 81(4), 661\u2013670 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"64_CR22","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Lackner, M., Pfandler, A.: The complexity of nearly single-peaked consistency. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence, pp. 283\u2013289 (2013)","DOI":"10.1609\/aaai.v27i1.8608"},{"issue":"4","key":"64_CR23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/malq.200810020","volume":"55","author":"G Erd\u00e9lyi","year":"2009","unstructured":"Erd\u00e9lyi, G., Nowak, M., Rothe, J.: Sincere-strategy preference-based approval voting fully resists constructive control and broadly resists destructive control. Math. Log. Q. 55(4), 425\u2013443 (2009)","journal-title":"Math. Log. Q."},{"key":"64_CR24","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: Proceedings of the 18th European Conference on Artificial Intelligence, pp. 366\u2013370. IOS Press (2008)","DOI":"10.3233\/978-1-58603-891-5-366"},{"key":"64_CR25","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"11","key":"64_CR26","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Using complexity to protect elections. Commun. ACM 53(11), 74\u201382 (2010)","journal-title":"Commun. ACM"},{"key":"64_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.artint.2013.11.004","volume":"207","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207, 69\u201399 (2014)","journal-title":"Artif. Intell."},{"key":"64_CR28","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1613\/jair.4621","volume":"52","author":"P Faliszewski","year":"2015","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Weighted electoral control. J. Artif. Intell. Res. 52, 507\u2013542 (2015)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"64_CR29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ic.2010.09.001","volume":"209","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2), 89\u2013107 (2011)","journal-title":"Inf. Comput."},{"key":"64_CR30","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Reisch, Y., Rothe, J., Schend, L.: Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Autonomous Agents and Multi-Agent Systems, 2015. To appear (2015)","DOI":"10.1007\/s10458-014-9277-x"},{"key":"64_CR31","volume-title":"Handbook of Computational Social Choice, Chapter\u00a07","author":"P Faliszewski","year":"2015","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, Chapter\u00a07. Cambridge University Press, Cambridge (2015)"},{"key":"64_CR32","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M Fellows","year":"2009","unstructured":"Fellows, M., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410, 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"64_CR33","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"issue":"5\u20136","key":"64_CR34","doi-asserted-by":"crossref","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.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"64_CR35","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H Kuhn","year":"1955","unstructured":"Kuhn, H.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"64_CR36","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10683-006-9149-6","volume":"11","author":"J Laslier","year":"2008","unstructured":"Laslier, J., Van der Straeten, K.: A live experiment on approval voting. Exp. Econ. 11(1), 97\u2013105 (2008)","journal-title":"Exp. Econ."},{"key":"64_CR37","unstructured":"Magrino, T., Rivest, R., Shen, E., Wagner, D.: Computing the margin of victory in IRV elections. In: Electronic Voting Technology Workshop\/Workshop on Trushworthy Elections (2011)"},{"issue":"4","key":"64_CR38","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00224-012-9441-0","volume":"53","author":"C Menton","year":"2013","unstructured":"Menton, C.: Normalized range voting broadly resists control. Theory Comput. Syst. 53(4), 507\u2013531 (2013)","journal-title":"Theory Comput. Syst."},{"key":"64_CR39","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"key":"64_CR40","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"3","key":"64_CR41","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s00355-010-0448-7","volume":"35","author":"K Straeten Van der","year":"2010","unstructured":"Van der Straeten, K., Laslier, J., Sauger, N., Blais, A.: Strategic, sincere, and heuristic voting under four election rules: an experimental study. Soc. Choice Welf. 35(3), 435\u2013472 (2010)","journal-title":"Soc. Choice Welf."},{"issue":"3","key":"64_CR42","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9 Tardos","year":"1985","unstructured":"Tardos, \u00c9.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3), 247\u2013255 (1985)","journal-title":"Combinatorica"},{"key":"64_CR43","unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, pp. 3\u20138. AAAI Press (2007)"},{"key":"64_CR44","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"},{"key":"64_CR45","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.3186","volume":"41","author":"L Xia","year":"2011","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners given partial orders. J. Artif. Intell. Res. 41, 25\u201367 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"64_CR46","unstructured":"Xia, L., Zuckerman, M., Procaccia, A., Conitzer, V., Rosenschein, J.: Complexity of unweighted manipulation under some common voting rules. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 348\u2013353. AAAI Press (2009)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0064-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0064-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0064-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0064-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T10:31:02Z","timestamp":1748601062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0064-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,2]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0064-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2015,9,2]]}}}