Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Fine-Grained Complexity and Algorithms for the Schulze Voting Method

Fine-Grained Complexity and Algorithms for the Schulze Voting Method

Thumbnail Image
Download
Name

3465456.3467630.pdf

Description
Published version
Size

1.56 MB

Format

Adobe PDF

Checksum (MD5)

021a354c578af7da45addfd6f94bc6da

sword-2022-07-21T16:55:09.original.xml (130 B)
Original SWORD entry document
Author(s)
Sornat, Krzysztof
•
Vassilevska Williams, Virginia
•
Xu, Yinzhan
Date Issued
2021
Journal
Proceedings of the 22nd ACM Conference on Economics and Computation
Publisher
Association for Computing Machinery (ACM)
Citation
Sornat, Krzysztof, Vassilevska Williams, Virginia and Xu, Yinzhan. 2021. "Fine-Grained Complexity and Algorithms for the Schulze Voting Method." Proceedings of the 22nd ACM Conference on Economics and Computation.
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/143943
DOI of Published Version
https://doi.org/10.1145/3465456.3467630
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.