{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T21:48:46Z","timestamp":1785793726086,"version":"3.56.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T00:00:00Z","timestamp":1356048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00224-012-9441-0","type":"journal-article","created":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T14:53:10Z","timestamp":1356015190000},"page":"507-531","source":"Crossref","is-referenced-by-count":15,"title":["Normalized Range Voting Broadly Resists Control"],"prefix":"10.1007","volume":"53","author":[{"given":"Curtis","family":"Menton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,12,21]]},"reference":[{"issue":"4","key":"9441_CR1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"K. Arrow","year":"1950","unstructured":"Arrow, K.: A\u00a0difficulty in the concept of social welfare. J. Polit. Econ. 58(4), 328\u2013346 (1950)","journal-title":"J. Polit. Econ."},{"key":"9441_CR2","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.\u00a0199\u2013251. Springer, Berlin (2010)"},{"key":"9441_CR3","first-page":"44","volume-title":"Proceedings of the 23rd AAAI Conference on Artificial Intelligence","author":"E. Brelsford","year":"2008","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, July 2008, pp.\u00a044\u201349 (2008)"},{"key":"9441_CR4","first-page":"55","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence","author":"N. Betzler","year":"2011","unstructured":"Betzler, N., Niedermeier, R., Woeginger, G.: Unweighted coalitional manipulation under the Borda rule is NP-hard. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.\u00a055\u201360 (2011)"},{"issue":"3","key":"9441_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi, J. III, Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"8\/9","key":"9441_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J. Bartholdi III","year":"1992","unstructured":"Bartholdi, J. III, Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Model. 16(8\/9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"9441_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-540-85097-7_5","volume-title":"Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications","author":"N. Betzler","year":"2008","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. In: Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol.\u00a05156, pp.\u00a043\u201353. Springer, Berlin (2008)"},{"key":"9441_CR8","first-page":"314","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence","author":"V. Conitzer","year":"2002","unstructured":"Conitzer, V., Sandholm, T.: Complexity of manipulating elections with few candidates. In: Proceedings of the 18th National Conference on Artificial Intelligence, July\/August 2002, pp.\u00a0314\u2013319 (2002)"},{"key":"9441_CR9","first-page":"627","volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence","author":"V. Conitzer","year":"2006","unstructured":"Conitzer, V., Sandholm, T.: Nonexistence of voting rules that are usually hard to manipulate. In: Proceedings of the 21st National Conference on Artificial Intelligence, pp.\u00a0627\u2013634. AAAI Press, Menlo Park (2006)"},{"key":"9441_CR10","volume-title":"Proceedings of the 25th AAAI Conference on Artificial Intelligence","author":"J. Davies","year":"2011","unstructured":"Davies, J., Katsirelos, G., Narodytska, N., Walsh, T.: Complexity of and algorithms for Borda manipulation. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence, August (2011)"},{"issue":"1","key":"9441_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/PL00007177","volume":"17","author":"J. Duggan","year":"2000","unstructured":"Duggan, J., Schwartz, T.: Strategic manipulability without resoluteness or shared beliefs: Gibbard\u2013Satterthwaite generalized. Soc. Choice Welf. 17(1), 85\u201393 (2000)","journal-title":"Soc. Choice Welf."},{"key":"9441_CR12","first-page":"163","volume-title":"Proceedings of the 3rd International Workshop on Computational Social Choice","author":"G. Erd\u00e9lyi","year":"2010","unstructured":"Erd\u00e9lyi, G., Fellows, M.: Parameterized control complexity in bucklin voting and in fallback voting. In: Proceedings of the 3rd International Workshop on Computational Social Choice, pp.\u00a0163\u2013174 (2010)"},{"issue":"38\u201340","key":"9441_CR13","doi-asserted-by":"crossref","first-page":"3995","DOI":"10.1016\/j.tcs.2009.06.026","volume":"410","author":"G. Erd\u00e9lyi","year":"2009","unstructured":"Erd\u00e9lyi, G., Hemaspaandra, L., Rothe, J., Spakowski, H.: Generalized juntas and NP-hard sets. Theor. Comput. Sci. 410(38\u201340), 3995\u20134000 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9441_CR14","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":"9441_CR15","first-page":"837","volume-title":"Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems","author":"G. Erd\u00e9lyi","year":"2011","unstructured":"Erd\u00e9lyi, G., Piras, L., Rothe, J.: The complexity of voter partition in Bucklin and fallback voting: solving three open problems. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, pp.\u00a0837\u2013844 (2011)"},{"key":"9441_CR16","first-page":"39","volume-title":"Proceedings of Computing: The 16th Australasian Theory Symposium","author":"G. Erd\u00e9lyi","year":"2010","unstructured":"Erd\u00e9lyi, G., Rothe, J.: Control complexity in fallback voting. In: Proceedings of Computing: The 16th Australasian Theory Symposium, pp.\u00a039\u201348 (2010)"},{"key":"9441_CR17","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.: The complexity of bribery in elections. J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"9441_CR18","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P. Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. 35, 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9441_CR19","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":"9441_CR20","first-page":"243","volume-title":"Proceedings of the 49th IEEE Symposium on Foundations of Computer Science","author":"E. Friedgut","year":"2008","unstructured":"Friedgut, E., Kalai, G., Nisan, N.: Elections can be manipulated often. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science, October 2008, pp.\u00a0243\u2013249 (2008)"},{"issue":"4","key":"9441_CR21","doi-asserted-by":"crossref","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A. Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"9441_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"5\u20136","key":"9441_CR23","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":"4","key":"9441_CR24","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/malq.200810019","volume":"55","author":"E. Hemaspaandra","year":"2009","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Hybrid elections broaden complexity-theoretic resistance to control. Math. Log. Q. 55(4), 397\u2013424 (2009)","journal-title":"Math. Log. Q."},{"key":"9441_CR25","doi-asserted-by":"crossref","unstructured":"Hillinger, C.: The case for utilitarian voting. Discussion Papers in Economics 653, University of Munich, Department of Economics, May (2005)","DOI":"10.2139\/ssrn.732285"},{"issue":"2","key":"9441_CR26","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s00493-012-2704-1","volume":"32","author":"M. Isaksson","year":"2012","unstructured":"Isaksson, M., Kindler, G., Mossel, E.: The geometry of manipulation\u2014a quantitative proof of the Gibbard-Satterthwaite theorem. Combinatorica 32(2), 221\u2013250 (2012)","journal-title":"Combinatorica"},{"issue":"27\u201329","key":"9441_CR27","doi-asserted-by":"crossref","first-page":"2746","DOI":"10.1016\/j.tcs.2009.04.004","volume":"410","author":"H. Liu","year":"2009","unstructured":"Liu, H., Feng, H., Zhu, D., Luan, J.: Parameterized computational complexity of control problems in voting systems. Theor. Comput. Sci. 410(27\u201329), 2746\u20132753 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"9441_CR28","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ipl.2010.03.006","volume":"110","author":"H. Liu","year":"2010","unstructured":"Liu, H., Zhu, D.: Parameterized complexity of control problems in maximin election. Inf. Process. Lett. 110(10), 383\u2013388 (2010)","journal-title":"Inf. Process. Lett."},{"key":"9441_CR29","unstructured":"Mossel, E., Procaccia, A., R\u00e1cz, M.: A smooth transition from powerlessness to absolute power. Technical Report (2012). arXiv:1205.2074 [cs.GT]"},{"key":"9441_CR30","first-page":"1041","volume-title":"Proceedings of the 44th ACM Symposium on Theory of Computing","author":"E. Mossel","year":"2012","unstructured":"Mossel, E., R\u00e1cz, M.: A\u00a0quantitative Gibbard-Satterthwaite theorem without neutrality. In: Proceedings of the 44th ACM Symposium on Theory of Computing, May 2012, pp.\u00a01041\u20131060 (2012)"},{"key":"9441_CR31","first-page":"718","volume-title":"Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems","author":"A. Procaccia","year":"2007","unstructured":"Procaccia, A., Rosenschein, J.: Average-case tractability of manipulation in voting via the fraction of manipulators. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, pp.\u00a0718\u2013720 (2007)"},{"key":"9441_CR32","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1613\/jair.2148","volume":"28","author":"A. Procaccia","year":"2007","unstructured":"Procaccia, A., Rosenschein, J.: Junta distributions and the average-case complexity of manipulating elections. J. Artif. Intell. Res. 28, 157\u2013181 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"9441_CR33","first-page":"1429","volume-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence","author":"D. Parkes","year":"2012","unstructured":"Parkes, D., Xia, L.: A\u00a0complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp.\u00a01429\u20131435 (2012)"},{"issue":"2","key":"9441_CR34","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"M. Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.: Strategy-proofness and Arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theory"},{"key":"9441_CR35","unstructured":"Smith, W.: Range voting. http:\/\/web.archive.org\/web\/20090326062716\/ . http:\/\/math.temple.edu\/~wds\/homepage\/rangevote.pdf , November 2000"},{"key":"9441_CR36","first-page":"1","volume":"42","author":"T. Walsh","year":"2011","unstructured":"Walsh, T.: Where are the hard manipulation problems? J. Artif. Intell. Res. 42, 1\u201329 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"9441_CR37","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1386790.1386811","volume-title":"Proceedings of the 9th ACM Conference on Electronic Commerce","author":"L. Xia","year":"2008","unstructured":"Xia, L., Conitzer, V.: Generalized scoring rules and the frequency of coalitional manipulability. In: Proceedings of the 9th ACM Conference on Electronic Commerce, July 2008, pp.\u00a0109\u2013118 (2008)"},{"key":"9441_CR38","volume-title":"Proceedings of the 4th International Workshop on Computational Social Choice","author":"L. Xia","year":"2012","unstructured":"Xia, L.: How many vote operations are needed to manipulate a voting system? In: Proceedings of the 4th International Workshop on Computational Social Choice, September (2012)"},{"issue":"2","key":"9441_CR39","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.artint.2008.11.005","volume":"173","author":"M. Zuckerman","year":"2009","unstructured":"Zuckerman, M., Procaccia, A., Rosenschein, J.: Algorithms for the coalitional manipulation problem. Artif. Intell. 173(2), 392\u2013412 (2009)","journal-title":"Artif. Intell."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9441-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9441-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9441-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T10:15:57Z","timestamp":1562494557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9441-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,21]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9441"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9441-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,21]]}}}