{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:10:24Z","timestamp":1774635024972,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CAREER Award, CCF-1528078, CCF-1514339, CCF-1909429, BSF:2012338"],"award-info":[{"award-number":["CAREER Award, CCF-1528078, CCF-1514339, CCF-1909429, BSF:2012338"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["Research Fellowship"],"award-info":[{"award-number":["Research Fellowship"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Research Fellowship"],"award-info":[{"award-number":["Research Fellowship"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2018\/28\/T\/ST6\/00366"],"award-info":[{"award-number":["2018\/28\/T\/ST6\/00366"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467630","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:45Z","timestamp":1626604125000},"page":"841-859","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fine-Grained Complexity and Algorithms for the Schulze Voting Method"],"prefix":"10.1145","author":[{"given":"Krzysztof","family":"Sornat","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virginia","family":"Vassilevska Williams","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinzhan","family":"Xu","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"e_1_3_2_1_2_1","volume-title":"Computing and Software Science - State of the Art and Perspectives. LNCS","author":"Aziz Haris","unstructured":"Haris Aziz , Felix Brandt , Edith Elkind , and Piotr Skowron . 2019. Computational Social Choice: The First Ten Years and Beyond . In Computing and Software Science - State of the Art and Perspectives. LNCS , Vol. 10000 . Springer , 48--65. Haris Aziz, Felix Brandt, Edith Elkind, and Piotr Skowron. 2019. Computational Social Choice: The First Ten Years and Beyond. In Computing and Software Science - State of the Art and Perspectives. LNCS, Vol. 10000. Springer, 48--65."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of STACS","author":"Barman Siddharth","year":"2021","unstructured":"Siddharth Barman , Omar Fawzi , and Paul Ferm\u00e9 . 2021 . Tight Approximation Guarantees for Concave Coverage Problems . In Proceedings of STACS 2021. 9:1--9:17. Siddharth Barman, Omar Fawzi, and Paul Ferm\u00e9. 2021. Tight Approximation Guarantees for Concave Coverage Problems. In Proceedings of STACS 2021. 9:1--9:17."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_6"},{"key":"e_1_3_2_1_5_1","unstructured":"Jan Behrens Axel Kistner Andreas Nitsche and Bj\u00f6rn Swierczek. 2014. The Principles of LiquidFeedback .Interaktive Demokratiee. V.  Jan Behrens Axel Kistner Andreas Nitsche and Bj\u00f6rn Swierczek. 2014. The Principles of LiquidFeedback .Interaktive Demokratiee. V."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316335"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3896"},{"key":"e_1_3_2_1_8_1","volume-title":"Handbook of Computational Social Choice","author":"Brandt Felix","unstructured":"Felix Brandt , Markus Brill , and Paul Harrenstein . 2016a. Tournament Solutions . In Handbook of Computational Social Choice . Cambridge University Press , 57--84. Felix Brandt, Markus Brill, and Paul Harrenstein. 2016a. Tournament Solutions. In Handbook of Computational Social Choice. Cambridge University Press, 57--84."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Felix Brandt Vincent Conitzer Ulle Endriss J\u00e9r\u00f4me Lang and Ariel D. Procaccia (Eds.). 2016b. Handbook of Computational Social Choice. Cambridge University Press.  Felix Brandt Vincent Conitzer Ulle Endriss J\u00e9r\u00f4me Lang and Ariel D. Procaccia (Eds.). 2016b. Handbook of Computational Social Choice. Cambridge University Press.","DOI":"10.1017\/CBO9781107446984.002"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2014.6867518"},{"key":"e_1_3_2_1_11_1","volume-title":"Interactive Democracy. In Proceedings of AAMAS","author":"Brill Markus","year":"2018","unstructured":"Markus Brill . 2018 . Interactive Democracy. In Proceedings of AAMAS 2018. 1183--1187. Markus Brill. 2018. Interactive Democracy. In Proceedings of AAMAS 2018. 1183--1187."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/25"},{"key":"e_1_3_2_1_13_1","volume-title":"Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh.","author":"Cygan Marek","year":"2015","unstructured":"Marek Cygan , Fedor V. Fomin , \u0141ukasz Kowalik , Daniel Lokshtanov , D\u00e1 niel Marx , Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh. 2015 . Parameterized Algorithms. Springer . Marek Cygan, Fedor V. Fomin, \u0141ukasz Kowalik, Daniel Lokshtanov, D\u00e1 niel Marx, Marcin Pilipczuk, Micha\u0142 Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer."},{"key":"e_1_3_2_1_14_1","unstructured":"Britta Dorn and Ildik\u00f3 Schlotter. 2017. Having a Hard Time? Explore Parameterized Complexity! In Trends in Computational Social Choice. AI Access 209--230.  Britta Dorn and Ildik\u00f3 Schlotter. 2017. Having a Hard Time? Explore Parameterized Complexity! In Trends in Computational Social Choice. AI Access 209--230."},{"key":"e_1_3_2_1_15_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"1999","unstructured":"Rodney G. Downey and Michael R . Fellows . 1999 . Parameterized Complexity. Springer . Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity. Springer."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/39"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of EC","author":"Elkind Edith","year":"2012","unstructured":"Edith Elkind , Piotr Faliszewski , and Arkadii M. Slinko . 2012. Clone Structures in Voters' Preferences . In Proceedings of EC 2012 . 496--513. Edith Elkind, Piotr Faliszewski, and Arkadii M. Slinko. 2012. Clone Structures in Voters' Preferences. In Proceedings of EC 2012. 496--513."},{"key":"e_1_3_2_1_19_1","unstructured":"Ulle Endriss (Ed.). 2017. Trends in Computational Social Choice. AI Access.  Ulle Endriss (Ed.). 2017. Trends in Computational Social Choice. AI Access."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011901"},{"key":"e_1_3_2_1_22_1","volume-title":"Encyclopedia of Algorithms. 1516--1520.","author":"Faliszewski Piotr","unstructured":"Piotr Faliszewski and Rolf Niedermeier . 2016. Parameterization in Computational Social Choice . In Encyclopedia of Algorithms. 1516--1520. Piotr Faliszewski and Rolf Niedermeier. 2016. Parameterization in Computational Social Choice. In Encyclopedia of Algorithms. 1516--1520."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3390\/a13060146"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of AAMAS","author":"Gaspers Serge","year":"2013","unstructured":"Serge Gaspers , Thomas Kalinowski , Nina Narodytska , and Toby Walsh . 2013 . Coalitional Manipulation for Schulze's Rule . In Proceedings of AAMAS 2013. 431--438. Serge Gaspers, Thomas Kalinowski, Nina Narodytska, and Toby Walsh. 2013. Coalitional Manipulation for Schulze's Rule. In Proceedings of AAMAS 2013. 431--438."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-015-9479-1"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of STOC","author":"Khot Subhash","year":"2002","unstructured":"Subhash Khot . 2002 . On the Power of Unique 2-Prover 1-Round Games . In Proceedings of STOC 2002. 767--775. Subhash Khot. 2002. On the Power of Unique 2-Prover 1-Round Games. In Proceedings of STOC 2002. 767--775."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of CPM","author":"Labib Karim","year":"2019","unstructured":"Karim Labib , Przemys\u0142aw Uzna'nski , and Daniel Wolleb-Graf . 2019 . Hamming Distance Completeness . In Proceedings of CPM 2019. 14:1--14:17. Karim Labib, Przemys\u0142aw Uzna'nski, and Daniel Wolleb-Graf. 2019. Hamming Distance Completeness. In Proceedings of CPM 2019. 14:1--14:17."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.67"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of ITCS","author":"Lincoln Andrea","year":"2020","unstructured":"Andrea Lincoln , Adam Polak , and Virginia Vassilevska Williams . 2020 . Monochromatic Triangles, Intermediate Matrix Products, and Convolutions . In Proceedings of ITCS 2020. 53:1--53:18. Andrea Lincoln, Adam Polak, and Virginia Vassilevska Williams. 2020. Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. In Proceedings of ITCS 2020. 53:1--53:18."},{"key":"e_1_3_2_1_31_1","unstructured":"Evangelos Markakis. 2017. Approximation Algorithms and Hardness Results for Fair Division with Indivisible Goods. In Trends in Computational Social Choice. AI Access 231--247.  Evangelos Markakis. 2017. Approximation Algorithms and Hardness Results for Fair Division with Indivisible Goods. In Trends in Computational Social Choice. AI Access 231--247."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90071-O"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907926"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of IJCAI","author":"Menton Curtis Glen","year":"2013","unstructured":"Curtis Glen Menton and Preetjot Singh . 2013 . Control Complexity of Schulze Voting . In Proceedings of IJCAI 2013. 286--292. Curtis Glen Menton and Preetjot Singh. 2013. Control Complexity of Schulze Voting. In Proceedings of IJCAI 2013. 286--292."},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of AAAI","author":"David","year":"2012","unstructured":"David C. Parkes and Lirong Xia. 2012. A Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs . In Proceedings of AAAI 2012 . 1429--1435. David C. Parkes and Lirong Xia. 2012. A Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs. In Proceedings of AAAI 2012. 1429--1435."},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of STAIRS","author":"Reisch Yannick","year":"2014","unstructured":"Yannick Reisch , J\u00f6 rg Rothe , and Lena Schend . 2014 . The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants . In Proceedings of STAIRS 2014. 250--259. Yannick Reisch, J\u00f6 rg Rothe, and Lena Schend. 2014. The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants. In Proceedings of STAIRS 2014. 250--259."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3374857.3374870"},{"key":"e_1_3_2_1_38_1","volume-title":"Geometry of Voting","author":"Saari Donald G.","unstructured":"Donald G. Saari . 1994. Geometry of Voting . Springer , Berlin, Heidelberg . Donald G. Saari. 1994. Geometry of Voting. Springer, Berlin, Heidelberg."},{"key":"e_1_3_2_1_39_1","first-page":"9","article-title":"A New Monotonic and Clone-Independent Single-Winner Election Method","volume":"17","author":"Schulze Markus","year":"2003","unstructured":"Markus Schulze . 2003 . A New Monotonic and Clone-Independent Single-Winner Election Method . Voting Matters , Vol. 17 , 1 (2003), 9 -- 19 . Markus Schulze. 2003. A New Monotonic and Clone-Independent Single-Winner Election Method. Voting Matters, Vol. 17, 1 (2003), 9--19.","journal-title":"Voting Matters"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-010-0475-4"},{"key":"e_1_3_2_1_41_1","volume-title":"The Schulze Method of Voting. CoRR","author":"Schulze Markus","year":"2018","unstructured":"Markus Schulze . 2018. The Schulze Method of Voting. CoRR , Vol. abs\/ 1804 .02973 ( 2018 ). Markus Schulze. 2018. The Schulze Method of Voting. CoRR, Vol. abs\/1804.02973 (2018)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9328-x"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.09.003"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914033"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1033"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00433944"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a009"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789813272880_0188"},{"key":"e_1_3_2_1_50_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Widest_path_problem. [Online","author":"Wikipedia","year":"2021","unstructured":"Wikipedia contributors. 2021. Widest Path Problem--Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Widest_path_problem. [Online ; accessed 26- May - 2021 ]. Wikipedia contributors. 2021. Widest Path Problem--Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Widest_path_problem. [Online; accessed 26-May-2021]."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.103"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467630","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467630","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":51,"alternative-id":["10.1145\/3465456.3467630","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467630","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}