Self-Equivalent Voting Rules
The paper introduces 'self-equivalence,' a stability axiom for stochastic voting rules, meaning a society won't change its rule if it is self-equivalent. Theorem 1 proves that the only rule satisfying anonymity, efficiency, monotonicity, neutrality, and self-equivalence is the uniform random dictatorship. This suggests why societies sometimes switch rules or hold binary elections.