{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T12:51:10Z","timestamp":1748523070154,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T00:00:00Z","timestamp":1466467200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2012\/06\/M\/ST1\/00358"],"award-info":[{"award-number":["2012\/06\/M\/ST1\/00358"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"name":"AGH University of Science and Technology (statutory research)","award":["11.11.230.015"],"award-info":[{"award-number":["11.11.230.015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10458-016-9339-3","type":"journal-article","created":{"date-parts":[[2016,6,21]],"date-time":"2016-06-21T10:28:55Z","timestamp":1466504935000},"page":"606-627","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["How hard is control in single-crossing elections?"],"prefix":"10.1007","volume":"31","author":[{"given":"Krzysztof","family":"Magiera","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,21]]},"reference":[{"issue":"2","key":"9339_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.geb.2011.02.004","volume":"73","author":"S Barber\u00e0","year":"2011","unstructured":"Barber\u00e0, S., & Moreno, B. (2011). Top monotonicity: A common root for single peakedness, single crossing and the median voter result. Games and Economic Behavior, 73(2), 345\u2013359.","journal-title":"Games and Economic Behavior"},{"issue":"8\/9","key":"9339_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi III","year":"1992","unstructured":"Bartholdi, J, I. I. I., Tovey, C., & Trick, M. (1992). How hard is it to control an election? Mathematical and Computer Modeling, 16(8\/9), 27\u201340.","journal-title":"Mathematical and Computer Modeling"},{"key":"9339_CR3","volume-title":"The theory of committees and elections","author":"D Black","year":"1958","unstructured":"Black, D. (1958). The theory of committees and elections. Cambridge: Cambridge University Press."},{"key":"9339_CR4","doi-asserted-by":"publisher","unstructured":"Brandt, F., Brill, M., & Harrenstein, P. (2016). Tournament solutions. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice, Chap. 3. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9781107446984.004"},{"key":"9339_CR5","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. (2015). Bypassing combinatorial protections: Polynomial-time algorithms for single-peaked electorates. Journal of Artificial Intelligence Research, 53, 439\u2013496.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"9339_CR6","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. (2013). A characterization of the single-crossing domain. Social Choice and Welfare, 41(4), 989\u2013998.","journal-title":"Social Choice and Welfare"},{"key":"9339_CR7","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. (2015). Combinatorial voter control in elections. Theoretical Computer Science, 589, 99\u2013120.","journal-title":"Theoretical Computer Science"},{"key":"9339_CR8","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Hemaspaandra, E., & Hemaspaandra, L. (2016). Dodgson\u2019s rule and Young\u2019s rule. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice, Chap. 5. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9781107446984.006"},{"key":"9339_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1613\/jair.2606","volume":"35","author":"V Conitzer","year":"2009","unstructured":"Conitzer, V. (2009). Eliciting single-peaked preferences using comparison queries. Journal of Artificial Intelligence Research, 35, 161\u2013191.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9339_CR10","unstructured":"Cornaz, D., Galand, L., & Spanjaard, O. (2013). Kemeny elections with bounded single-peaked or single-crossing width. In Proceedings of the 23rd international joint conference on artificial intelligence (pp. 76\u201382)."},{"issue":"2","key":"9339_CR11","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"J Doignon","year":"1994","unstructured":"Doignon, J., & Falmagne, J. (1994). A polynomial time algorithm for unidimensional unfolding representations. Journal of Algorithms, 16(2), 218\u2013233.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"9339_CR12","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1111\/1468-0262.00228","volume":"69","author":"B Dutta","year":"2001","unstructured":"Dutta, B., Jackson, M. O., & Le Breton, M. (2001). Strategic candidacy and voting procedures. Econometrica, 69(4), 1013\u20131037.","journal-title":"Econometrica"},{"key":"9339_CR13","doi-asserted-by":"publisher","unstructured":"Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. In Proceedings of the 10th international World Wide Web conference (March 2001) (pp. 613\u2013622). New York: ACM Press.","DOI":"10.1145\/371920.372165"},{"key":"9339_CR14","unstructured":"Elkind, E., & Lackner, M. (2015). Structure in dichotomous preferences. In Proceedings of the 24th international joint conference on artificial intelligence (2015)."},{"key":"9339_CR15","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Lackner, M., & Obraztsova, S. (2015). The complexity of recognizing incomplete single-crossing preferences. In Proceedings of the 29th AAAI conference on artificial intelligence (pp. 865\u2013871).","DOI":"10.1609\/aaai.v29i1.9321"},{"key":"9339_CR16","doi-asserted-by":"publisher","unstructured":"Elkind, E., Faliszewski, P., & Slinko, A.(2012). \u2018Clone structures in voters\u2019 preferences\u2019. In Proceedings of the 13th ACM conference on electronic commerce (June 2012) (pp. 496\u2013513).","DOI":"10.1145\/2229012.2229050"},{"issue":"1\u20134","key":"9339_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1018924209812","volume":"20","author":"E Ephrati","year":"1997","unstructured":"Ephrati, E., & Rosenschein, J. (1997). A heuristic technique for multi-agent planning. Annals of Mathematics and Artificial Intelligence, 20(1\u20134), 13\u201367.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9339_CR18","unstructured":"Erd\u00e9lyi, G., & Rothe, J. (2010). Control complexity in fallback voting. In Proceedings of computing: The 16th Australasian theory symposium. Conferences in Research and Practice in Information Technology Series (January 2010) (Vol. 32, pp. 39\u201348). Sydney: Australian Computer Society."},{"issue":"4","key":"9339_CR19","doi-asserted-by":"publisher","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 abd, J., & Schend, L. (2015). Control complexity in Bucklin and fallback voting: An experimental analysis. Journal of Computer and System Sciences, 81(4), 661\u2013670.","journal-title":"Journal of Computer and System Sciences"},{"key":"9339_CR20","unstructured":"Faliszewski, P., & Rothe, J. (2015). Control and bribery in voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice, Chap. 7. Cambridge: Cambridge University Press."},{"issue":"11","key":"9339_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. (2010). Using complexity to protect elections. Communications of the ACM, 53(11), 74\u201382.","journal-title":"Communications of the ACM"},{"key":"9339_CR22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.3136","volume":"40","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., & Hemaspaandra, L. (2011). Multimode control attacks on elections. Journal of Artificial Intelligence Research, 40, 305\u2013351.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9339_CR23","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. (2014). The complexity of manipulative attacks in nearly single-peaked electorates. Artificial Intelligence, 207, 69\u201399.","journal-title":"Artificial Intelligence"},{"key":"9339_CR24","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. (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"},{"issue":"2","key":"9339_CR25","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., & Rothe, J. (2011). The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Information and Computation, 209(2), 89\u2013107.","journal-title":"Information and Computation"},{"key":"9339_CR26","doi-asserted-by":"publisher","unstructured":"Fischer, F., Hudry, O., & Niedermeier, R. (2016). Weighted tournament solutions. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice, Chap. 4. Cambridge: Cambridge University Press.","DOI":"10.1017\/CBO9781107446984.005"},{"key":"9339_CR27","doi-asserted-by":"publisher","unstructured":"Ghosh, S., Mundhe, M., Hernandez, K., & Sen, S. (1999). Voting for movies: The anatomy of recommender systems. In Proceedings of the 3rd annual conference on autonomous agents (1999) (pp. 434\u2013435). New York: ACM Press.","DOI":"10.1145\/301136.301303"},{"issue":"5\u20136","key":"9339_CR28","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"},{"key":"9339_CR29","doi-asserted-by":"publisher","unstructured":"Lang, J., Maudet, N., & Polukarov, M. (2013). New results on equilibria in strategic candidacy. In Proceedings of the 6th international symposium on algorithmic game theory. LNCS (October 2013) (Vol 8146, pp. 13\u201325). Berlin: Springer.","DOI":"10.1007\/978-3-642-41392-6_2"},{"issue":"27\u201329","key":"9339_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. (2009). Parameterized computational complexity of control problems in voting systems. Theoretical Computer Science, 410(27\u201329), 2746\u20132753.","journal-title":"Theoretical Computer Science"},{"key":"9339_CR31","unstructured":"Lu, T., & Boutilier, C. (2011). Budgeted social choice: From consensus to personalized decision making. In Proceedings of the 22nd international joint conference on artificial intelligence (pp. 280\u2013286)."},{"key":"9339_CR32","doi-asserted-by":"publisher","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).","DOI":"10.1007\/978-3-642-41575-3_20"},{"key":"9339_CR33","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A., Rosenschein, J., & Zohar, A. (2008). The complexity of strategic behavior in multi-winner elections. Journal of Artificial Intelligence Research, 33, 149\u2013178.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9339_CR34","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"J Mirrlees","year":"1971","unstructured":"Mirrlees, J. (1971). An exploration in the theory of optimal income taxation. Review of Economic Studies, 38, 175\u2013208.","journal-title":"Review of Economic Studies"},{"key":"9339_CR35","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. (1994). Computational complexity. Reading: Addison-Wesley."},{"key":"9339_CR36","unstructured":"Parkes, D., & Xia, L. (2012). A complexity-of-strategic-behavior comparison between Schulze\u2019s rule and ranked pairs. In Proceedings of the 26th AAAI conference on artificial intelligence (July 2012) (pp. 1429\u20131435)."},{"key":"9339_CR37","volume-title":"Political economics: Explaining economic policy","author":"T Persson","year":"2000","unstructured":"Persson, T., & Tabellini, G. (2000). Political economics: Explaining economic policy. Cambridge: MIT Press."},{"key":"9339_CR38","unstructured":"Polukarov, M., Obraztsova, S., Rabinovich, Z., Kruglyi, A., & Jennings, N. (2015). Convergence to equilibria in strategic candidacy. In Proceedings of the 24th international joint conference on artificial intelligence."},{"issue":"3","key":"9339_CR39","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0047-2727(77)90005-6","volume":"8","author":"K Roberts","year":"1977","unstructured":"Roberts, K. (1977). Voting over income tax schedules. Journal of Public Economics, 8(3), 329\u2013340.","journal-title":"Journal of Public Economics"},{"issue":"4","key":"9339_CR40","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00224-002-1093-z","volume":"36","author":"J Rothe","year":"2003","unstructured":"Rothe, J., Spakowski, H., & Vogel, J. (2003). Exact complexity of the winner problem for Young elections. Theory of Computing Systems, 36(4), 375\u2013386.","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"9339_CR41","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01376281","volume":"7","author":"P Rothstein","year":"1990","unstructured":"Rothstein, P. (1990). Order restricted preferences and majority rule. Social Choice and Welfare, 7(4), 331\u2013342.","journal-title":"Social Choice and Welfare"},{"issue":"2\u20133","key":"9339_CR42","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF00123744","volume":"72","author":"P Rothstein","year":"1991","unstructured":"Rothstein, P. (1991). Representative voter theorems. Public Choice, 72(2\u20133), 193\u2013212.","journal-title":"Public Choice"},{"issue":"2","key":"9339_CR43","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00355-006-0098-y","volume":"26","author":"A Saporiti","year":"2006","unstructured":"Saporiti, A., & Tohm\u00e9, F. (2006). Single-crossing, strategic voting and the median choice rule. Social Choice and Welfare, 26(2), 363\u2013383.","journal-title":"Social Choice and Welfare"},{"key":"9339_CR44","doi-asserted-by":"publisher","unstructured":"Skowron, P., Yu, L., Faliszewski, P., & Elkind, E. (2013). The complexity of fully proportional representation for single-crossing electorates. In Proceedings of the 6th international symposium on algorithmic game theory (pp. 1\u201312).","DOI":"10.1007\/978-3-642-41392-6_1"},{"key":"9339_CR45","unstructured":"Walsh, T. (2007). Uncertainty in preference elicitation and aggregation. In Proceedings of the 22nd AAAI conference on artificial intelligence (July 2007) (pp. 3\u20138). Menlo Park: AAAI Press."},{"issue":"2","key":"9339_CR46","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0022-0531(77)90012-6","volume":"16","author":"H Young","year":"1977","unstructured":"Young, H. (1977). Extending Condorcet\u2019s rule. Journal of Economic Theory, 16(2), 335\u2013353.","journal-title":"Journal of Economic Theory"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9339-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-016-9339-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9339-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9339-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T00:45:06Z","timestamp":1656722706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-016-9339-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,21]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9339"],"URL":"https:\/\/doi.org\/10.1007\/s10458-016-9339-3","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2016,6,21]]}}}