{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:40Z","timestamp":1759638940095},"publisher-location":"Berlin, Heidelberg","reference-count":134,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308901"},{"type":"electronic","value":"9783642308918"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30891-8_16","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T09:24:05Z","timestamp":1340011445000},"page":"318-363","source":"Crossref","is-referenced-by-count":13,"title":["Studies in Computational Aspects of Voting"],"prefix":"10.1007","author":[{"given":"Nadja","family":"Betzler","sequence":"first","affiliation":[]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N. Ailon","year":"2010","unstructured":"Ailon, N.: Aggregation of Partial Rankings, p-Ratings, and Top-m Lists. Algorithmica\u00a057(2), 284\u2013300 (2010)","journal-title":"Algorithmica"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-02927-1_6","volume-title":"Automata, Languages and Programming","author":"N. Alon","year":"2009","unstructured":"Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 49\u201358. Springer, Heidelberg (2009)"},{"key":"16_CR4","unstructured":"Arrow, K.J., Sen, A.K., Suzumura, K. (eds.): Handbook of Social Choice and Welfare, vol.\u00a01. North-Holland (2002)"},{"key":"16_CR5","unstructured":"Arrow, K.J., Sen, A.K., Suzumura, K. (eds.): Handbook of Social Choice and Welfare, vol.\u00a02. North-Holland (2010)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF00649265","volume":"1","author":"J.S. Banks","year":"1985","unstructured":"Banks, J.S.: Sophisticated Voting Outcomes and Agenda Control. Social Choice and Welfare\u00a01(4), 295\u2013306 (1985)","journal-title":"Social Choice and Welfare"},{"issue":"7","key":"16_CR8","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2007.12.088","volume":"309","author":"T.C. Biedl","year":"2009","unstructured":"Biedl, T.C., Brandenburg, F.-J., Deng, X.: On the Complexity of Crossings in Permutations. Discrete Mathematics\u00a0309(7), 1813\u20131823 (2009)","journal-title":"Discrete Mathematics"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-17493-3_5","volume-title":"Parameterized and Exact Computation","author":"N. Betzler","year":"2010","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R.: Partial Kernelization for Rank Aggregation: Theory and Experiments. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 26\u201337. Springer, Heidelberg (2010)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-18381-2_10","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"N. Betzler","year":"2011","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 123\u2013134. Springer, Heidelberg (2011)"},{"issue":"1\u20132","key":"16_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N. Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On Bounded-Degree Vertex Deletion Parameterized by Treewidth. Discrete Applied Mathematics\u00a0160(1\u20132), 53\u201360 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR12","unstructured":"Brandt, F., Brill, M., Seedig, H.G.: On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 85\u201390. AAAI Press (2011)"},{"key":"16_CR13","unstructured":"Brandt, F., Conitzer, V., Endriss, U.: Computational Social Choice. In: Weiss, G. (ed.) Multiagent Systems. MIT Press (2012)"},{"issue":"8","key":"16_CR14","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N. Betzler","year":"2010","unstructured":"Betzler, N., Dorn, B.: Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. Journal of Computer and System Sciences\u00a076(8), 812\u2013836 (2010)","journal-title":"Journal of Computer and System Sciences"},{"issue":"8","key":"16_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On Problems Without Polynomial Kernels. Journal of Computer and System Sciences\u00a075(8), 423\u2013434 (2009)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Computational Aspects of Approval Voting. In: Laslier, J.-F., Remzi Sanver, M. (eds.) Handbook on Approval Voting, ch. 10, pp. 199\u2013251. Springer (2010)","DOI":"10.1007\/978-3-642-02839-7_10"},{"key":"16_CR17","unstructured":"Betzler, N.: A Multivariate Complexity Analysis of Voting Problems. PhD thesis, Friedrich-Schiller-Universit\u00e4t Jena (2010)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-15155-2_12","volume-title":"Mathematical Foundations of Computer Science 2010","author":"N. Betzler","year":"2010","unstructured":"Betzler, N.: On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 114\u2013125. Springer, Heidelberg (2010)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Brams, S., Fishburn, P.C.: Voting Procedures. In: Arrow, K.J., Sen, A.K., Suzumura, K. (eds.) Handbook of Social Choice and Welfare, vol.\u00a01, pp. 173\u2013236. Elsevier (2002)","DOI":"10.1016\/S1574-0110(02)80008-X"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"4554","DOI":"10.1016\/j.tcs.2009.08.033","volume":"410","author":"N. Betzler","year":"2009","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-Parameter Algorithms for Kemeny Rankings. Theoretical Computer Science\u00a0410, 4554\u20134570 (2009)","journal-title":"Theoretical Computer Science"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.jcss.2010.07.005","volume":"77","author":"N. Betzler","year":"2011","unstructured":"Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average Parameterization and Partial Kernelization for Computing Medians. Journal of Computer and System Sciences\u00a077, 774\u2013789 (2011)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2009.10.001","volume":"208","author":"N. Betzler","year":"2010","unstructured":"Betzler, N., Guo, J., Niedermeier, R.: Parameterized Computational Complexity of Dodgson and Young Elections. Information and Computation\u00a0208(2), 165\u2013177 (2010)","journal-title":"Information and Computation"},{"key":"16_CR23","unstructured":"Betzler, N., Hemmann, S., Niedermeier, R.: A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp. 53\u201358 (2009)"},{"key":"16_CR24","unstructured":"Betzler, N., Niedermeier, R., Woeginger, G.J.: Unweighted Coalitional Manipulation Under the Borda Rule is NP-hard. In: Proceedings of 22nd International Joint Conference of Artificial Intelligence, pp. 55\u201360 (2011)"},{"key":"16_CR25","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00183045","volume":"8","author":"J.J. Bartholdi III","year":"1991","unstructured":"Bartholdi III, J.J., Orlin, J.B.: Single Transferable Vote Resists Strategic Voting. Social Choice and Welfare\u00a08, 341\u2013354 (1991)","journal-title":"Social Choice and Welfare"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New Upper and Lower Bound Techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Brams, S., Remzi Sanver, M.: 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 (2009)","DOI":"10.1007\/978-3-540-79128-7_12"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the Computation of Fully Proportional Representation (2011) (available at Social Science Research Network)","DOI":"10.2139\/ssrn.1952497"},{"issue":"3","key":"16_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J.J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: The Computational Difficulty of Manipulating an Election. Social Choice and Welfare\u00a06(3), 227\u2013241 (1989)","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J.J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: Voting Schemes for Which It Can Be Difficult to Tell Who Won the Election. Social Choice and Welfare\u00a06(2), 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"issue":"8-9","key":"16_CR31","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? Mathematical and Computer Modeling\u00a016(8-9), 27\u201340 (1992)","journal-title":"Mathematical and Computer Modeling"},{"issue":"35","key":"16_CR32","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel Bounds for Disjoint Cycles and Disjoint Paths. Theoretical Computer Science\u00a0412(35), 4570\u20134578 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"52","key":"16_CR33","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. Theoretical Computer Science\u00a0410(52), 5425\u20135442 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR34","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"J.R. Chamberlin","year":"1983","unstructured":"Chamberlin, J.R., Courant, P.N.: Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule. American Political Science Review\u00a077(3), 718\u2013733 (1983)","journal-title":"American Political Science Review"},{"key":"16_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0168-0072(95)00020-8","volume":"84","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice Classes of Parameterized Tractability. Annals of Pure and Applied Logic\u00a084, 119\u2013138 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-69507-3_4","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"Y. Chevaleyre","year":"2007","unstructured":"Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A Short Introduction to Computational Social Choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 51\u201369. Springer, Heidelberg (2007)"},{"issue":"3","key":"16_CR37","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R. Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., Slinko, A.: On Complexity of Lobbying in Multiple Referenda. Review of Economic Design\u00a011(3), 217\u2013224 (2007)","journal-title":"Review of Economic Design"},{"key":"16_CR38","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/S1571-0653(05)80125-8","volume":"5","author":"I. Charon","year":"2000","unstructured":"Charon, I., Hudry, O.: Slater Orders and Hamiltonian Paths of Tournaments. Electronic Notes in Discrete Mathematics\u00a05, 60\u201363 (2000)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"16_CR39","unstructured":"Chevaleyre, Y., Lang, J., Maudet, N., Monnot, J., Xia, L.: New Candidates Welcome! Possible Winners with Respect to the Addition of New Candidates. In: CoRR, abs\/1111.3690 (2011)"},{"key":"16_CR40","unstructured":"Conitzer, V.: Computing Slater Rankings Using Similarities among Candidates. In: Proceedings of the 21st AAAI Conference on Artificial Intelligence, pp. 613\u2013619. AAAI Press (2006)"},{"key":"16_CR41","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. Communications of the ACM\u00a053, 84\u201394 (2010)","journal-title":"Communications of the ACM"},{"key":"16_CR42","unstructured":"Copeland, A.H.: A \u2018Resonable\u2019 Social Welfare Function. Mimeographed (University of Michigan Seminar on Application of Mathematics in Social Science) (1951)"},{"key":"16_CR43","unstructured":"Conitzer, V., Rognlie, M., Xia, L.: Preference Functions That Score Rankings and Maximum Likelihood Estimation. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 109\u2013115 (2009)"},{"key":"16_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V. Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When Are Elections with Few Candidates Hard to Manipulate? Journal of the ACM\u00a054, 1\u201333 (2007)","journal-title":"Journal of the ACM"},{"key":"16_CR45","unstructured":"de Borda, J.-C.: M\u00e9moire sur les \u00e9lections au scrutin. Histoire de l\u2019Acad\u00e9mie Royale des Sciences (1781)"},{"key":"16_CR46","unstructured":"Caritat, M.J.A.N., de Condorcet: Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. L\u2019Imprimerie Royale, Paris (1785)"},{"key":"16_CR47","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank Aggregation Methods for the Web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622. ACM (2001)","DOI":"10.1145\/371920.372165"},{"key":"16_CR49","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank Aggregation Revisited (2001) (manuscript)"},{"key":"16_CR50","doi-asserted-by":"crossref","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, pp. 657\u2013662. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7873"},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through Colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"16_CR52","unstructured":"Dodgson, C.: A Method of Taking Votes on More Than Two Issues. Pamphlet printed by the Clarendon Press, Oxford, and headed (1876) (not yet published)"},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"Dorn, B., Schlotter, I.: Multivariate Complexity Analysis of Swap Bribery. Algorithmica (2012) (available electronically)","DOI":"10.1007\/s00453-011-9568-4"},{"issue":"4","key":"16_CR54","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.cosrev.2011.09.002","volume":"5","author":"R.G. Downey","year":"2011","unstructured":"Downey, R.G., Thilikos, D.M.: Confronting Intractability via Parameters. Computer Science Review\u00a05(4), 279\u2013317 (2011)","journal-title":"Computer Science Review"},{"key":"16_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-17572-5_40","volume-title":"Internet and Network Economics","author":"E. Elkind","year":"2010","unstructured":"Elkind, E., Faliszewski, P.: Approximation Algorithms for Campaign Management. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 473\u2013482. Springer, Heidelberg (2010)"},{"key":"16_CR56","unstructured":"Erd\u00e9lyi, G., Fellows, M.R.: Parameterized Control Complexity in Bucklin Voting and in Fallback Voting. In: Proceedings of the 3rd International Workshop on Computational Social Choice, pp. 163\u2013174 (2010)"},{"key":"16_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-04428-1_8","volume-title":"Algorithmic Decision Theory","author":"G. Erd\u00e9lyi","year":"2009","unstructured":"Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., Raible, D., Rothe, J.: The Complexity of Probabilistic Lobbying. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS, vol.\u00a05783, pp. 86\u201397. Springer, Heidelberg (2009)"},{"key":"16_CR58","unstructured":"Erd\u00e9lyi, G., Fellows, M.R., Piras, L., Rothe, J.: Control Complexity in Bucklin and Fallback Voting. Technical report, arXiv:1103.2230 (2011)"},{"key":"16_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E. Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap Bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 299\u2013310. Springer, Heidelberg (2009)"},{"key":"16_CR60","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Cloning in Elections. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 768\u2013773. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7606"},{"key":"16_CR61","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 (2010)"},{"key":"16_CR62","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. Mathematical Logic Quaterly\u00a055, 425\u2013443 (2009)","journal-title":"Mathematical Logic Quaterly"},{"key":"16_CR63","unstructured":"Erd\u00e9lyi, G., Piras, L., Rothe, J.: Control Complexity in Fallback Voting. Technical report, arXiv:1004.3398v1 (2010)"},{"key":"16_CR64","unstructured":"Ephrati, E., Rosenschein, J.S.: The Clarke Tax as a Consensus Mechanism Among Automated Agents. In: Proceedings of the 9th AAAI Conference on Artificial Intelligence, pp. 173\u2013178. AAAI Press (1991)"},{"issue":"1\u20134","key":"16_CR65","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1018924209812","volume":"20","author":"E. Ephrati","year":"1997","unstructured":"Ephrati, E., Rosenschein, J.S.: A Heuristic Technique for Multi-Agent Planning. Annals of Mathematics and Artificial Intelligence\u00a020(1\u20134), 13\u201367 (1997)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"16_CR66","unstructured":"Erd\u00e9lyi, G., Rothe, J.: Control Complexity in Fallback Voting. In: Proceedings of Computing: the 16th Australasian Theory Symposium. Australian Computer Society Conferences in Research and Practice in Information Technology Series, pp. 39\u201348 (2010)"},{"key":"16_CR67","unstructured":"Faliszewski, P.: Nonuniform Bribery. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems, pp. 1569\u20131572 (2008)"},{"key":"16_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-10217-2_2","volume-title":"Combinatorial Algorithms","author":"M. Fellows","year":"2009","unstructured":"Fellows, M.: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 2\u201310. Springer, Heidelberg (2009)"},{"key":"16_CR69","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol.\u00a03, pp. 421\u2013432. Schloss Dagstuhl (2009)"},{"key":"16_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-19222-7_34","volume-title":"Combinatorial Algorithms","author":"H. Fernau","year":"2011","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Mnich, M., Philip, G., Saurabh, S.: Ranking and Drawing in Subexponential Time. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 337\u2013348. Springer, Heidelberg (2011)"},{"key":"16_CR71","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"key":"16_CR72","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.A.: How Hard Is Bribery in Elections? Journal of Artificial Intelligence Research\u00a035, 485\u2013532 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"11","key":"16_CR73","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.A.: Using Complexity to Protect Elections. Communications of the ACM\u00a053(11), 74\u201382 (2010)","journal-title":"Communications of the ACM"},{"key":"16_CR74","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.A.: Multimode Control Attacks on Elections. Journal of Artificial Intelligence Research\u00a040, 305\u2013351 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"16_CR75","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: A Richer Understanding of the Complexity of Election Systems. In: Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz, pp. 375\u2013406 (2009)","DOI":"10.1007\/978-1-4020-9688-4_14"},{"key":"16_CR76","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.A., Rothe, J.: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. Journal of Artificial Intelligence Research\u00a035, 275\u2013341 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"16_CR77","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"P.C. Fishburn","year":"1977","unstructured":"Fishburn, P.C.: Condorcet Social Choice Functions. SIAM Journal on Applied Mathematics\u00a033(3), 469\u2013489 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"16_CR78","unstructured":"Fellows, M.R., Jansen, B., Lokshtanov, D., Rosamond, F.A., Saurabh, S.: Determining the Winner of a Dodgson Election is Hard. In: Proceedings of the 29th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 459\u2013469. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"16_CR79","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient Similarity Search and Classification via Rank Aggregation. In: Proceedings of the 22nd ACM SIGMOD International Conference on Management of Data, pp. 301\u2013312. ACM (2003)","DOI":"10.1145\/872794.872795"},{"issue":"1","key":"16_CR80","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of Instance Compression and Succinct PCPs for NP. Journal of Computer and System Sciences\u00a077(1), 91\u2013106 (2011)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR81","unstructured":"Gaertner, W.: A Primer in Social Choice Theory\u2013LSE Perspectives in Economic Analysis, revised edition. Oxford University Press (2009)"},{"issue":"4","key":"16_CR82","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A. Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of Voting Schemes: A General Result. Econometrica\u00a041(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"16_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-02094-0_4","volume-title":"Algorithmics of Large and Complex Networks","author":"J. Guo","year":"2009","unstructured":"Guo, J., Moser, H., Niedermeier, R.: Iterative Compression for Exactly Solving NP-Hard Minimization Problems. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 65\u201380. Springer, Heidelberg (2009)"},{"issue":"1","key":"16_CR84","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to Data Reduction and Problem Kernelization. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"16_CR85","unstructured":"Goodman, L.A.: On Methods of Amalgamation. In: Thrall, R.M., Coombs, C.H., Davis, R.L. (eds.) Decision Processes, pp. 39\u201348. John Wiley and Sons, Inc. (1954)"},{"issue":"6","key":"16_CR86","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Exact Analysis of Dodgson Elections: Lewis Caroll\u2019s 1876 Voting System is Complete for Parallel Access to NP. Journal of the ACM\u00a044(6), 806\u2013825 (1997)","journal-title":"Journal of the ACM"},{"issue":"5-6","key":"16_CR87","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. Artificial Intelligence\u00a0171(5-6), 255\u2013285 (2007)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"16_CR88","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1002\/malq.200810019","volume":"55","author":"E. Hemaspaandra","year":"2009","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. Mathematical Logic Quarterly\u00a055(4), 397\u2013424 (2009)","journal-title":"Mathematical Logic Quarterly"},{"issue":"3","key":"16_CR89","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E. Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The Complexity of Kemeny Elections. Theoretical Computer Science\u00a0349(3), 382\u2013391 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"16_CR90","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00355-003-0241-y","volume":"23","author":"O. Hudry","year":"2004","unstructured":"Hudry, O.: A Note On \u201cBanks Winners in Tournaments Are Difficult to Recognize\u201d by G. J. Woeginger. Social Choice and Welfare\u00a023(1), 113\u2013114 (2004)","journal-title":"Social Choice and Welfare"},{"key":"16_CR91","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the Complexity of k-SAT. Journal of Computer and System Sciences\u00a062, 367\u2013375 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"16_CR92","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which Problems Have Strongly Exponential Complexity? Journal of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"16_CR93","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/TCBB.2007.70221","volume":"5","author":"B.N. Jackson","year":"2008","unstructured":"Jackson, B.N., Schnable, P.S., Aluru, S.: Consensus Genetic Maps as Median Orders from Inconsistent Sources. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a05(2), 161\u2013171 (2008)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"16_CR94","first-page":"571","volume":"88","author":"J.G. Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics Without Numbers. Daedalus\u00a088, 571\u2013591 (1959)","journal-title":"Daedalus"},{"key":"16_CR95","unstructured":"Konczak, K., Lang, J.: Voting Procedures with Incomplete Preferences. In: Proceedings of IJCAI 2005 Multidisciplinary Workshop on Advances in Preference Handling, pp. 124\u2013129 (2005)"},{"key":"16_CR96","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jda.2010.07.003","volume":"9","author":"C. Komusiewicz","year":"2011","unstructured":"Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing Intractability\u2014A Multivariate Complexity Analysis of Interval Constrained Coloring. Journal of Discrete Algorithms\u00a09, 137\u2013151 (2011)","journal-title":"Journal of Discrete Algorithms"},{"key":"16_CR97","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"Algorithms and Computation","author":"M. Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 3\u201314. Springer, Heidelberg (2010)"},{"key":"16_CR98","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Addison-Wesley (2006)"},{"key":"16_CR99","unstructured":"Lu, T., Boutilier, C.: Budgeted Social Choice: From Consensus to Personalized Decision Making. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 280\u2013286 (2011)"},{"issue":"4","key":"16_CR100","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. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"16_CR101","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/bs.3830200105","volume":"20","author":"A. Levenglick","year":"1975","unstructured":"Levenglick, A.: Fair and Reasonable Election Systems. Behavioral Science\u00a020(1), 34\u201346 (1975)","journal-title":"Behavioral Science"},{"key":"16_CR102","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. Theoretical Computer Science\u00a0410, 2746\u20132753 (2009)","journal-title":"Theoretical Computer Science"},{"key":"16_CR103","unstructured":"Lokshtanov, D.: New Methods in Parameterized Algorithms and Complexity. PhD thesis, University of Bergen (2009)"},{"key":"16_CR104","unstructured":"Lindner, C., Rothe, J.: Fixed-Parameter Tractability and Parameterized Complexity Applied to Problems From Computational Social Choice. In: Supplement in the Mathematical Programming Glossary (October 2008)"},{"issue":"10","key":"16_CR105","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. Information Processing Letters\u00a0110(10), 383\u2013388 (2010)","journal-title":"Information Processing Letters"},{"key":"16_CR106","unstructured":"Matou\u0161ek, J., G\u00e4rtner, B.: Understanding and Using Linear Programming (Universitext). Springer (2006)"},{"issue":"4","key":"16_CR107","doi-asserted-by":"publisher","first-page":"925","DOI":"10.2307\/2082518","volume":"89","author":"B.L. Monroe","year":"1995","unstructured":"Monroe, B.L.: Fully Proportional Representation. American Political Science Review\u00a089(4), 925\u2013940 (1995)","journal-title":"American Political Science Review"},{"key":"16_CR108","unstructured":"Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press (1991)"},{"issue":"2","key":"16_CR109","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing Above Guaranteed Values: MaxSat and MaxCut. Journal of Algorithms\u00a031(2), 335\u2013354 (1999)","journal-title":"Journal of Algorithms"},{"key":"16_CR110","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M. Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing Above or Below Guaranteed Values. Journal of Computer and System Sciences\u00a075, 137\u2013153 (2009)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"16_CR111","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.disopt.2010.10.001","volume":"8","author":"N. Misra","year":"2011","unstructured":"Misra, N., Raman, V., Saurabh, S.: Lower Bounds on Kernelization. Discrete Optimization\u00a08(1), 110\u2013128 (2011)","journal-title":"Discrete Optimization"},{"key":"16_CR112","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (February 2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"16_CR113","unstructured":"Niedermeier, R.: Reflections on Multivariate Algorithmics and Problem Parameterization. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol.\u00a05, pp. 17\u201332 (2010)"},{"key":"16_CR114","doi-asserted-by":"crossref","unstructured":"Nurmi, H.: Comparing Voting Systems. Kluwer Academic Publishers (1987)","DOI":"10.1007\/978-94-009-3985-1"},{"key":"16_CR115","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"key":"16_CR116","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1016\/j.artint.2010.11.009","volume":"175","author":"M.S. Pini","year":"2011","unstructured":"Pini, M.S., Rossi, F., Brent Venable, K., Walsh, T.: Incompleteness and Incomparability in Preference Aggregation: Complexity Results. Artificial Intelligence\u00a0175, 1272\u20131289 (2011)","journal-title":"Artificial Intelligence"},{"key":"16_CR117","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A.D. Procaccia","year":"2008","unstructured":"Procaccia, A.D., Rosenschein, J.S., Zohar, A.: On the Complexity of Achieving Proportional Representation. Social Choice and Welfare\u00a030, 353\u2013362 (2008)","journal-title":"Social Choice and Welfare"},{"key":"16_CR118","volume-title":"Einf\u00fchrung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen","author":"J. Rothe","year":"2011","unstructured":"Rothe, J., Baumeister, D., Lindner, C., Rothe, I.: Einf\u00fchrung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen. Spektrum Akademischer Verlag, W\u00e4hlen und Teilen (2011)"},{"issue":"2","key":"16_CR119","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ipl.2007.05.014","volume":"104","author":"V. Raman","year":"2007","unstructured":"Raman, V., Saurabh, S.: Improved Fixed Parameter Tractable Algorithms for Two \u201cEdge\u201d Problems: MAXCUT and MAXDAG. Information Processing Letters\u00a0104(2), 65\u201372 (2007)","journal-title":"Information Processing Letters"},{"issue":"4","key":"16_CR120","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.: Exact Complexity of the Winner Problem for Young Elections. Theory of Computing Systems\u00a036(4), 375\u2013386 (2003)","journal-title":"Theory of Computing Systems"},{"key":"16_CR121","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B.A. Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding Odd Cycle Transversals. Operations Research Letters\u00a032, 299\u2013301 (2004)","journal-title":"Operations Research Letters"},{"key":"16_CR122","doi-asserted-by":"crossref","unstructured":"Satterthwaite, M.A.: Strategy-Proofness and Arrow\u2019s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions. Journal of Economic Theory, 187\u2013217 (1975)","DOI":"10.1016\/0022-0531(75)90050-2"},{"key":"16_CR123","doi-asserted-by":"crossref","unstructured":"Sculley, D.W.: Rank Aggregation for Similar Items. In: Proceedings of the 7th SIAM International Conference on Data Mining, pp. 587\u2013592 (2007)","DOI":"10.1137\/1.9781611972771.66"},{"key":"16_CR124","doi-asserted-by":"crossref","unstructured":"Schlotter, I., Elkind, E., Faliszewski, P.: Campaign Management under Approval-Driven Voting Rules. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence, pp. 726\u2013731. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.7870"},{"key":"16_CR125","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-11269-0_26","volume-title":"Parameterized and Exact Computation","author":"N. Simjour","year":"2009","unstructured":"Simjour, N.: Improved Parameterized Algorithms for the Kemeny Aggregation Problem. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 312\u2013323. Springer, Heidelberg (2009)"},{"issue":"3-4","key":"16_CR126","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1093\/biomet\/48.3-4.303","volume":"48","author":"P. Slater","year":"1961","unstructured":"Slater, P.: Inconsistencies in a Schedule of Paired Comparisons. Biometrika\u00a048(3-4), 303\u2013312 (1961)","journal-title":"Biometrika"},{"issue":"3","key":"16_CR127","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1108\/15265940810875603","volume":"9","author":"M. Sniedovich","year":"2008","unstructured":"Sniedovich, M.: Wald\u2019s Maximin Model: A Treasure in Disguise! Journal of Risk Finance\u00a09(3), 287\u2013291 (2008)","journal-title":"Journal of Risk Finance"},{"key":"16_CR128","doi-asserted-by":"crossref","unstructured":"Taylor, A.D.: Social Choice and the Mathematics of Manipulation. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511614316"},{"key":"16_CR129","doi-asserted-by":"crossref","unstructured":"Wald, A.: Statistical Decision Functions. The Annals of Mathematical Statistics\u00a020(2) (1949)","DOI":"10.1214\/aoms\/1177730030"},{"key":"16_CR130","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)"},{"issue":"3","key":"16_CR131","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Banks Winners in Tournaments are Difficult to Recognize. Social Choice and Welfare\u00a020(3), 523\u2013528 (2003)","journal-title":"Social Choice and Welfare"},{"key":"16_CR132","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 under Common Voting Rules Given Partial Orders. Journal of Artificial Intelligence Research\u00a041, 25\u201367 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"16_CR133","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"H.P. Young","year":"1978","unstructured":"Young, H.P., Levenglick, A.: A Consistent Extension of Condorcet\u2019s Election Principle. SIAM Journal on Applied Mathematics\u00a035(2), 285\u2013300 (1978)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"16_CR134","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0022-0531(77)90012-6","volume":"16","author":"H.P. Young","year":"1977","unstructured":"Young, H.P.: Extending Condorcet\u2019s Rule. Journal of Economic Theory\u00a016, 335\u2013353 (1977)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","The Multivariate Algorithmic Revolution and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30891-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T15:02:24Z","timestamp":1687532544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30891-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308901","9783642308918"],"references-count":134,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30891-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}