{"type":"ScholarlyArticle","title":"Computing the Schulze Method for Large-Scale Preference Data Sets","authors":[{"name":"Theresa Csar","slug":"theresa-csar","given":"Theresa","family":"Csar","affiliation":"TU Wien , Austria"},{"name":"Martin Lackner","slug":"martin-lackner","given":"Martin","family":"Lackner","affiliation":"TU Wien , Austria"},{"name":"Reinhard Pichler","slug":"reinhard-pichler","given":"Reinhard","family":"Pichler","affiliation":"TU Wien , Austria"}],"abstract":"The Schulze method is a voting rule widely used in practice and enjoys many positive axiomatic properties. While it is computable in polynomial time, its straight-forward implementation does not scale well for large elections. \r\nIn this paper, we develop a highly optimised algorithm for computing the Schulze method with Pregel, a framework for massively parallel computation of graph problems, and demonstrate its applicability for large preference data sets. In addition, our theoretic analysis shows that the Schulze method is indeed particularly well-suited for parallel computation, in stark contrast to the related ranked pairs method. More precisely we show that winner determination subject to the Schulze method is NL-complete, whereas this problem is P-complete for the ranked pairs method.","doi":"10.24963/ijcai.2018/25","url":"https://ijcai.org/proceedings/2018/25","pdf":"https://ijcai.org/proceedings/2018/0025.pdf","markdown":"https://ijcai.org/proceedings/2018/25.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/25","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":25,"pages":{"first":180,"last":187},"keywords":["Agent-based and Multi-agent Systems: Voting","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Ali and Meilȃ, 2012] Alnur Ali and Marina Meilȃ. Experi- ments with kemeny ranking: What works when? Mathe- matical Social Sciences, 64(1):28-40, 2012.","title":"Alnur Ali and Marina Meilȃ. Experiments with kemeny ranking: What works when","authors":"Meilȃ Ali","year":"2012","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Betzler et al., 2014] Nadja Betzler, Robert Bredereck, and Rolf Niedermeier. Theoretical and empirical evaluation of data reduction for exact kemeny rank aggregation. Au- tonomous Agents and Multi-Agent Systems, 28(5):721- 748, 2014.","title":"Theoretical and empirical evaluation of data reduction for exact kemeny rank aggregation","authors":"Nadja Betzler, Robert Bredereck, Rolf Niedermeier","year":"2014","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brandt et al., 2009] Felix Brandt, Felix Fischer, and Paul Harrenstein. The computational complexity of choice sets. Mathematical Logic Quarterly, 55(4):444-459, 2009.","title":"The computational complexity of choice sets","authors":"Felix Brandt, Felix Fischer, Paul Harrenstein","year":"2009","venue":"Mathematical Logic Quarterly","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brandt et al., 2016] Felix Brandt, Markus Brill, and Paul Harrenstein. Tournament solutions. In Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel Procaccia, editors, Handbook of Computational Social Choice. Cambridge University Press, 2016.","title":"Tournament solutions","authors":"Felix Brandt, Markus Brill, Paul Harrenstein","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brill and Fischer, 2012] Markus Brill and Felix Fischer. The price of neutrality for the ranked pairs method. In Proceedings of AAAI-12, 2012.","title":"The price of neutrality for the ranked pairs method","authors":"Fischer Brill, Markus Brill, Felix Fischer","year":"2012","venue":"Proceedings of AAAI-12","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Conitzer et al., 2006] Vincent Conitzer, Andrew Davenport, and Jayant Kalagnanam. Improved bounds for computing Kemeny rankings. In Proceedings of AAAI-06, pages 620- 626, 2006.","title":"Improved bounds for computing Kemeny rankings","authors":"Vincent Conitzer, Andrew Davenport, Jayant Kalagnanam","year":"2006","venue":"Proceedings of AAAI-06","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Conitzer et al., 2009] Vincent Conitzer, Matthew Rognlie, and Lirong Xia. Preference functions that score rankings and maximum likelihood estimation. In Proceedings of IJCAI-09, pages 109-115, 2009.","title":"Preference functions that score rankings and maximum likelihood estimation","authors":"Vincent Conitzer, Matthew Rognlie, Lirong Xia","year":"2009","venue":"Proceedings of IJCAI-09","doi":null,"url":null,"internal_url":"/proceedings/2009/29"},{"position":8,"raw":"[Csar et al., 2017] Theresa Csar, Martin Lackner, Reinhard Pichler, and Emanuel Sallinger. Winner determination in huge elections with MapReduce. In Proceedings of AAAI- 17, 2017.","title":"Winner determination in huge elections with MapReduce","authors":"Theresa Csar, Martin Lackner, Reinhard Pichler, Emanuel Sallinger","year":"2017","venue":"Proceedings of AAAI-17","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dean and Ghemawat, 2008] Jeffrey Dean and Sanjay Ghe- mawat. MapReduce: simplified data processing on large clusters. Communications of the ACM, 51(1):107-113, 2008.","title":"MapReduce: simplified data processing on large clusters","authors":"Jeffrey Dean, Sanjay Ghemawat","year":"2008","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Jiang et al., 2017] Chunheng Jiang, Sujoy Sikdar, Jun Wang, Lirong Xia, and Zhibing Zhao. Practical algorithms for computing stv and other multi-round voting rules. In Proceedings of EXPLORE-17, 2017.","title":"Practical algorithms for computing stv and other multi-round voting rules","authors":"Jiang","year":"2017","venue":"Proceedings of EXPLORE-17","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Malewicz et al., 2010] Grzegorz Malewicz, Matthew H Austern, Aart JC Bik, James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of SIGMOD- 10, pages 135-146. ACM, 2010.","title":"Pregel: a system for large-scale graph processing","authors":"Grzegorz Malewicz, Matthew H Austern, J C Aart, James C Bik, Ilan Dehnert, Naty Horn, Grzegorz Leiser, Czajkowski","year":"2010","venue":"Proceedings of SIGMOD-10","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Mattei and Walsh, 2013] Nicholas Mattei and Toby Walsh. PrefLib: A library for preferences http://www.preflib.org. In Proceedings of ADT-13, pages 259-270, 2013.","title":"PrefLib: A library for preferences","authors":"Walsh ; Mattei, Nicholas Mattei, Toby Walsh","year":"2013","venue":null,"doi":null,"url":"http://www.preflib.org","internal_url":null},{"position":13,"raw":"[McGarvey, 1953] David C McGarvey. A theorem on the construction of voting paradoxes. Econometrica, 21(4):608-610, 1953.","title":"A theorem on the construction of voting paradoxes","authors":"C David, Mcgarvey","year":"1953","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Parkes and Xia, 2012] David C Parkes and Lirong Xia. A complexity-of-strategic-behavior comparison between schulze's rule and ranked pairs. In Proceedings of AAAI- 12, 2012.","title":"A complexity-of-strategic-behavior comparison between schulze's rule and ranked pairs","authors":"C David, Lirong Parkes, Xia","year":"2012","venue":"Proceedings of AAAI-12","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Sakr et al., 2013] Sherif Sakr, Anna Liu, and Ayman G Fay- oumi. The family of mapreduce and large-scale data processing systems. ACM Computing Surveys, 46(1):11, 2013.","title":"The family of mapreduce and large-scale data processing systems","authors":"Anna Sherif Sakr, Ayman G Liu, Fayoumi","year":"2013","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Salihoglu and Widom, 2014] Semih Salihoglu and Jennifer Widom. Optimizing graph algorithms on pregel-like sys- tems. Proceedings of VLDB-14, 7(7):577-588, 2014.","title":"Optimizing graph algorithms on pregel-like systems","authors":"Widom Salihoglu, Semih Salihoglu, Jennifer Widom","year":"2014","venue":"Proceedings of VLDB","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Schalekamp and van Zuylen, 2009] Frans Schalekamp and Anke van Zuylen. Rank aggregation: Together we're strong. In Proceedings of ALENEX-2009, pages 38-51, 2009.","title":"Rank aggregation: Together we're strong","authors":"Schalekamp, Frans Van Zuylen, Anke Schalekamp, Van Zuylen","year":"2009","venue":"Proceedings of ALENEX-2009","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Schulze, 2003] Markus Schulze. A new monotonic and clone-independent single-winner election method. Voting matters, 17(1):9-19, 2003.","title":"A new monotonic and clone-independent single-winner election method","authors":"Markus Schulze","year":"2003","venue":"Voting matters","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Schulze, 2011] Markus Schulze. A new monotonic, clone-independent, reversal symmetric, and condorcet- consistent single-winner election method. Social Choice and Welfare, 36(2):267-303, 2011.","title":"A new monotonic, clone-independent, reversal symmetric, and condorcetconsistent single-winner election method","authors":"Markus Schulze","year":"2011","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Tideman, 1987] T Nicolaus Tideman. Independence of clones as a criterion for voting rules. Social Choice and Welfare, 4(3):185-206, 1987.","title":"Independence of clones as a criterion for voting rules","authors":"Tideman Nicolaus","year":"1987","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Yan et al., 2014] Da Yan, James Cheng, Kai Xing, Yi Lu, Wilfred Ng, and Yingyi Bu. Pregel algorithms for graph connectivity problems with performance guarantees. Pro- ceedings of VLDB-14, 7(14):1821-1832, 2014.","title":"Pregel algorithms for graph connectivity problems with performance guarantees","authors":"Da Yan, James Cheng, Kai Xing, Yi Lu, Wilfred Ng, Yingyi Bu","year":"2014","venue":"Proceedings of VLDB","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zaharia et al., 2010] Matei Zaharia, Mosharaf Chowdhury, Michael J Franklin, Scott Shenker, and Ion Stoica. Spark: cluster computing with working sets. HotCloud, 10:10- 10, 2010.","title":"Spark: cluster computing with working sets","authors":"Matei Zaharia, Mosharaf Chowdhury, J Michael, Scott Franklin, Ion Shenker, Stoica","year":"2010","venue":"HotCloud","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zavist and Tideman, 1989] Thomas M Zavist and T Nico- laus Tideman. Complete independence of clones in the ranked pairs rule. Social Choice and Welfare, 6(2):167- 173, 1989.","title":"Complete independence of clones in the ranked pairs rule","authors":"M Thomas, T Zavist, Nicolaus Tideman","year":"1989","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}