{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:10Z","timestamp":1773656350967,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T00:00:00Z","timestamp":1516233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00224-018-9843-8","type":"journal-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T07:30:11Z","timestamp":1516260611000},"page":"1798-1825","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity of Voter Control in Multi-Peaked Elections"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-6818","authenticated-orcid":false,"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,18]]},"reference":[{"issue":"4","key":"9843_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"KJ Arrow","year":"1950","unstructured":"Arrow, K.J.: A difficulty in the concept of social welfare. J. Polit. Econ. 58 (4), 328\u2013346 (1950)","journal-title":"J. Polit. Econ."},{"issue":"2","key":"9843_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00355-010-0476-3","volume":"36","author":"MA Ballester","year":"2011","unstructured":"Ballester, M.A., Haeringer, G.: A characterization of the single-peaked domain. Soc. Choice Welf. 36(2), 305\u2013322 (2011)","journal-title":"Soc. Choice Welf."},{"issue":"8-9","key":"9843_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi III","year":"1992","unstructured":"Bartholdi, J. J., III, Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8-9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"9843_CR4","doi-asserted-by":"publisher","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 propotional representation. J. Artif. Intell. Res. 47, 475\u2013519 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"52","key":"9843_CR5","doi-asserted-by":"publisher","first-page":"5425","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 5425\u20135442 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9843_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"9843_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1613\/jair.4647","volume":"53","author":"F Brandt","year":"2015","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.A.: 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":"9843_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.mathsocsci.2015.11.002","volume":"79","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: Are there any nicely structured preference profiles nearby. Math. Soc. Sci. 79, 61\u201373 (2016)","journal-title":"Math. Soc. Sci."},{"key":"9843_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2015.04.023","volume":"589","author":"L Bulteau","year":"2015","unstructured":"Bulteau, L., Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Combinatorial voter control in elections. Theor. Comput. Sci. 589, 99\u2013120 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9843_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1666420.1666442","volume":"53","author":"V Conitzer","year":"2010","unstructured":"Conitzer, V.: Making decisions based on the preferences of multiple agents. Commun. ACM 53(3), 84\u201394 (2010)","journal-title":"Commun. ACM"},{"key":"9843_CR11","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: IJCAI, pp. 76\u201382 (2013)"},{"issue":"3","key":"9843_CR12","first-page":"389","volume":"3","author":"G Demange","year":"1983","unstructured":"Demange, G.: Single-peaked orders on a tree. Math. Soc. Sci. 3(3), 389\u2013396 (1983)","journal-title":"Math. Soc. Sci."},{"issue":"2","key":"9843_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"JP Doignon","year":"1994","unstructured":"Doignon, J.P., Falmagne, J.C.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithm. 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithm."},{"key":"9843_CR14","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity texts in computer science. Springer, Berlin (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"2","key":"9843_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0022381613001527","volume":"76","author":"PJ Egan","year":"2014","unstructured":"Egan, P.J.: Do something politics and double-peaked policy preferences. J. Polit. 76(2), 333\u2013349 (2014)","journal-title":"J. Polit."},{"key":"9843_CR16","doi-asserted-by":"crossref","unstructured":"Erd\u0117lyi, G., Hemaspaandra, E., Hemaspaandra, L.A.: More natural models of electoral control by partition. In: ADT, pp. 396\u2013413 (2015)","DOI":"10.1007\/978-3-319-23114-3_24"},{"key":"9843_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1613\/jair.5210","volume":"58","author":"G Erd\u00e9lyi","year":"2017","unstructured":"Erd\u00e9lyi, G., Lackner, M., Pfandler, A.: Computational aspects of nearly single-peaked electorates. J. Artif. Intell. Res. 58, 297\u2013337 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"9843_CR18","doi-asserted-by":"publisher","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":"9843_CR19","unstructured":"Erd\u00e9lyi, G., Reger, C., Yang, Y.: The complexity of bribery and control in group identification. In: AAMAS, pp. 1142\u20131150 (2017)"},{"key":"9843_CR20","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: ECAI, pp. 366\u2013370 (2008)","DOI":"10.3233\/978-1-58603-891-5-366"},{"key":"9843_CR21","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":"9843_CR22","doi-asserted-by":"publisher","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.A.: The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207, 69\u201399 (2014)","journal-title":"Artif. Intell."},{"key":"9843_CR23","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.A., 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":"9843_CR24","doi-asserted-by":"publisher","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.A., 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":"9843_CR25","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, chapter 7, pp 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"issue":"1","key":"9843_CR26","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.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9843_CR27","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11127-014-0180-4","volume":"160","author":"DS Felsenthal","year":"2014","unstructured":"Felsenthal, D.S., Tideman, N.: Weak Condorcet winner(s) revisited. Public Choice 160(3), 313\u2013326 (2014)","journal-title":"Public Choice"},{"issue":"4","key":"9843_CR28","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"UI Gupta","year":"1982","unstructured":"Gupta, U.I., Lee, D.T., Leung, J. Y. -T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12(4), 459\u2013467 (1982)","journal-title":"Networks"},{"issue":"5-6","key":"9843_CR29","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.A., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artif. Intell. 171(5-6), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"27-29","key":"9843_CR30","doi-asserted-by":"publisher","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-29), 2746\u20132753 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"9843_CR31","doi-asserted-by":"publisher","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":"9843_CR32","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2013.05.019","volume":"498","author":"H Liu","year":"2013","unstructured":"Liu, H., Zhu, D.: Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems. Theor. Comput. Sci. 498, 115\u2013123 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"9843_CR33","unstructured":"Russell, N.F.: Complexity of control of Borda count elections. Master\u2019s thesis, Rochester Institute of Technology (2007)"},{"key":"9843_CR34","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0047-2727(74)90005-X","volume":"3","author":"JE Stiglitz","year":"1974","unstructured":"Stiglitz, J.E.: The demand for education in public and private school systems. J. Pubilc Econ. 3, 349\u2013385 (1974)","journal-title":"J. Pubilc Econ."},{"key":"9843_CR35","unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: AAAI, pp. 3\u20138 (2007)"},{"key":"9843_CR36","unstructured":"Yang, Y.: Election attacks with few candidates. In: ECAI, pp. 1131\u20131132 (2014)"},{"key":"9843_CR37","unstructured":"Yang, Y.: Manipulation with bounded single-peaked width: A parameterized study. In: AAMAS, pp. 77\u201385 (2015)"},{"key":"9843_CR38","unstructured":"Yang, Y.: The complexity of control and bribery in majority judgement. In AAMAS, pp. 1169\u20131177 (2017)"},{"key":"9843_CR39","unstructured":"Yang, Y.: On the complexity of Borda control in single-peaked elections. In: AAMAS, pp. 1178\u20131186 (2017)"},{"key":"9843_CR40","unstructured":"Yang, Y., Guo, J.: Controlling elections with bounded single-peaked width. In: AAMAS, pp. 629\u2013636 (2014)"},{"key":"9843_CR41","unstructured":"Yang, Y., Guo, J.: How hard is control in multi-peaked elections: A parameterized study. In: AAMAS, pp. 1729\u20131730 (2015)"},{"key":"9843_CR42","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.jcss.2017.06.004","volume":"89","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Guo, J.: The control complexity of r-approval: From the single-peaked case to the general case. J. Comput. Syst. Sci. 89, 432\u2013449 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"9843_CR43","unstructured":"Yang, Y., Wang, J.: Anyone but them: The complexity challenge for a resolute election controller. In: AAMAS, pp. 1133\u20131141 (2017)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9843-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9843-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9843-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T22:23:47Z","timestamp":1751235827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9843-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,18]]},"references-count":43,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["9843"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9843-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,18]]},"assertion":[{"value":"18 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}