Robustness and Feasibility of Voting in Linear Social Choice
Published in ADT 2026, 2026
We study robustness and structural properties of rank aggregation rules (voting rules) in the linear social choice setting. We prove that a wide range of voting methods, including positional scoring rules, approval voting, pairwise-majority consistent rules, and instant-runoff voting, are not robust to errors in this setting, while direct aggregation of estimated utilities is. We also explore the relationship between feasible and attainable rankings, finding that for many voting rules, attainability does not imply feasibility.
Recommended citation: Chadwick, A., Kahng, A., Seow, E. (2026). "Robustness and Feasibility of Voting in Linear Social Choice." ADT 2026.
Download Paper