Geometric Comparisons of Electoral Rules Under Feedback
Sumit Mukherjee

TL;DR
This paper introduces geometric primitives to compare electoral rules based on how they influence voter and candidate polarization, revealing inherent tradeoffs through theoretical analysis and extensive simulations.
Contribution
It develops a geometric framework for analyzing electoral rules, demonstrating the tradeoff between voter polarization and candidate dispersion, supported by comprehensive simulation results.
Findings
Rules minimizing winner radius increase candidate dispersion.
Convex-combination rules balance polarization and dispersion.
Tradeoffs are confirmed through extensive simulation across diverse settings.
Abstract
We study how electoral rules shape polarization dynamics when voters and candidates both adapt to repeated election outcomes. We introduce two geometric primitives for comparing rules under this feedback: the \emph{winner radius} , the distance from the winner to the farthest voter, and the \emph{supporter centroid radius} , the largest gap between any candidate and their support base. We show that controls a one-step contraction bound on voter disagreement and plays the analogous role for candidate dispersion, and that these two objectives are in tension. Rules that reduce tend to increase , and vice versa. A winner close to the voter median does not resolve the tension, since proximity to the median and proximity to the Chebyshev center are different objectives. We use this framing to organize a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
