This work studies how precise central differential privacy and local differential privacy can be for common voting rules, including Plurality, Condorcet, Maximin, Plurality with Runoff, and Single Transferable Vote, and proves upper bounds on the required margin for these algorithms.
Quentin Hillebrand, Pasin Manurangsi, Vorapong Suppakitpaisarn et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.