Trading Off Voting Axioms for Privacy

Zhechen Li, Ao Liu, Lirong Xia, Yongzhi Cao, Hanpin Wang
Proceedings of the Forty-first Conference on Uncertainty in Artificial Intelligence, PMLR 286:2517-2536, 2025.

Abstract

In this paper, we investigate tradeoffs among differential privacy (DP) and several important voting axioms: Pareto efficiency, SD-efficiency, PC-efficiency, Condorcet criterion, and Condorcet loser criterion. We provide upper and lower bounds on the two-way tradeoffs between DP and each axiom. We also provide upper and lower bounds on three-way tradeoffs among DP and every pairwise combination of all the axioms, showing that, while the axioms are compatible without DP, their upper bounds cannot be achieved simultaneously under DP. Our results illustrate the effect of DP on the satisfaction and compatibility of voting axioms.

Cite this Paper

BibTeX
@InProceedings{pmlr-v286-li25a, title = {Trading Off Voting Axioms for Privacy}, author = {Li, Zhechen and Liu, Ao and Xia, Lirong and Cao, Yongzhi and Wang, Hanpin}, booktitle = {Proceedings of the Forty-first Conference on Uncertainty in Artificial Intelligence}, pages = {2517--2536}, year = {2025}, editor = {Chiappa, Silvia and Magliacane, Sara}, volume = {286}, series = {Proceedings of Machine Learning Research}, month = {21--25 Jul}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v286/main/assets/li25a/li25a.pdf}, url = {https://proceedings.mlr.press/v286/li25a.html}, abstract = {In this paper, we investigate tradeoffs among differential privacy (DP) and several important voting axioms: Pareto efficiency, SD-efficiency, PC-efficiency, Condorcet criterion, and Condorcet loser criterion. We provide upper and lower bounds on the two-way tradeoffs between DP and each axiom. We also provide upper and lower bounds on three-way tradeoffs among DP and every pairwise combination of all the axioms, showing that, while the axioms are compatible without DP, their upper bounds cannot be achieved simultaneously under DP. Our results illustrate the effect of DP on the satisfaction and compatibility of voting axioms.} }
Endnote
%0 Conference Paper %T Trading Off Voting Axioms for Privacy %A Zhechen Li %A Ao Liu %A Lirong Xia %A Yongzhi Cao %A Hanpin Wang %B Proceedings of the Forty-first Conference on Uncertainty in Artificial Intelligence %C Proceedings of Machine Learning Research %D 2025 %E Silvia Chiappa %E Sara Magliacane %F pmlr-v286-li25a %I PMLR %P 2517--2536 %U https://proceedings.mlr.press/v286/li25a.html %V 286 %X In this paper, we investigate tradeoffs among differential privacy (DP) and several important voting axioms: Pareto efficiency, SD-efficiency, PC-efficiency, Condorcet criterion, and Condorcet loser criterion. We provide upper and lower bounds on the two-way tradeoffs between DP and each axiom. We also provide upper and lower bounds on three-way tradeoffs among DP and every pairwise combination of all the axioms, showing that, while the axioms are compatible without DP, their upper bounds cannot be achieved simultaneously under DP. Our results illustrate the effect of DP on the satisfaction and compatibility of voting axioms.
APA
Li, Z., Liu, A., Xia, L., Cao, Y. & Wang, H.. (2025). Trading Off Voting Axioms for Privacy. Proceedings of the Forty-first Conference on Uncertainty in Artificial Intelligence, in Proceedings of Machine Learning Research 286:2517-2536 Available from https://proceedings.mlr.press/v286/li25a.html.

Related Material