{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:33:32Z","timestamp":1756308812671,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_14","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"153-164","source":"Crossref","is-referenced-by-count":1,"title":["Combinatorial Voter Control in Elections"],"prefix":"10.1007","author":[{"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J.J. Bartholdi III","year":"1986","unstructured":"Bartholdi III, J.J., Trick, M.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett.\u00a05(4), 165\u2013169 (1986)","journal-title":"Oper. Res. Lett."},{"issue":"8-9","key":"14_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J.J. Bartholdi III","year":"1992","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election. Math. Comput. Model.\u00a016(8-9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-30891-8_16","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"N. Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Chen, J., Niedermeier, R.: Studies in computational aspects of voting. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol.\u00a07370, pp. 318\u2013363. Springer, Heidelberg (2012)"},{"issue":"1","key":"14_CR4","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.\u00a056(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C. Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artificial Intelligence Res.\u00a021, 135\u2013191 (2004)","journal-title":"J. Artificial Intelligence Res."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.A.: Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates. In: Proc. 24th AAAI, pp. 715\u2013722 (2010)","DOI":"10.1609\/aaai.v24i1.7637"},{"issue":"4","key":"14_CR7","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00355-012-0717-8","volume":"41","author":"R. Bredereck","year":"2013","unstructured":"Bredereck, R., Chen, J., Woeginger, G.: A characterization of the single-crossing domain. Soc. Choice Welf.\u00a041(4), 989\u2013998 (2013)","journal-title":"Soc. Choice Welf."},{"key":"14_CR8","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., Niedermeier, R.: Prices matter for the parameterized complexity of shift bribery. In: Proc. 28th AAAI (to appear, 2014)"},{"key":"14_CR9","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. Artificial Intelligence Res.\u00a035, 161\u2013191 (2009)","journal-title":"J. Artificial Intelligence Res."},{"key":"14_CR10","unstructured":"Conitzer, V., Lang, J., Xia, L.: How hard is it to control sequential elections via the agenda? In: Proc. 21st IJCAI, pp. 103\u2013108 (July 2009)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Clone structures in voters\u2019 preferences. In: Proc. 13th EC, pp. 496\u2013513 (2012)","DOI":"10.1145\/2229012.2229050"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: Proc. 18th ECAI, pp. 366\u2013370 (2008)","DOI":"10.3233\/978-1-58603-891-5-366"},{"issue":"2","key":"14_CR14","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. Inform. and Comput.\u00a0209(2), 89\u2013107 (2011)","journal-title":"Inform. and Comput."},{"key":"14_CR15","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: Weighted electoral control. In: Proc. 12th AAMAS, pp. 367\u2013374 (2013)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Golab, L., Karloff, H., Korn, F., Saha, A., Srivastava, D.: Sequential dependencies. In: In 35th PVLDB, vol.\u00a02(1), pp. 574\u2013585 (2009)","DOI":"10.14778\/1687627.1687693"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00224-007-1309-3","volume":"41","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of Vertex Cover variants. Theory Comput. Syst.\u00a041(3), 501\u2013520 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"5-6","key":"14_CR18","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.\u00a0171(5-6), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"14_CR20","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.\u00a0410, 2746\u20132753 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR21","unstructured":"Magiera, K., Faliszewski, P.: How hard is control in single-crossing elections? In: Proc. 21st ECAI (to appear, 2014)"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0047-2727(77)90005-6","volume":"8","author":"K.W. Roberts","year":"1977","unstructured":"Roberts, K.W.: Voting over income tax schedules. J. Public Econ.\u00a08, 329\u2013340 (1977)","journal-title":"J. Public Econ."},{"issue":"8","key":"14_CR23","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Peke\u010d, A., Harstad, R.M.: Computationally manageable combinational auctions. Manage. Sci.\u00a044(8), 1131\u20131147 (1998)","journal-title":"Manage. Sci."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Sandholm, T.: Optimal winner determination algorithms. In: Cramton, Shoham, Steinberg (eds.) Combinatorial Auctions. ch. 14. MIT Press (2006)","DOI":"10.7551\/mitpress\/9780262033428.003.0015"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math.\u00a08(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:30:24Z","timestamp":1746333024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}