On voting rules satisfying false-name-proofness and participation
Pith reviewed 2026-05-23 01:53 UTC · model grok-4.3
The pith
False-name-proofness and participation together force anonymity and rule out neutrality on the universal domain of strict preferences.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
On the universal domain of strict preferences, false-name-proofness together with participation implies anonymity and is incompatible with neutrality. On the domain of separable preferences over subsets of objects, rules exist that satisfy false-name-proofness, participation, onto, object neutrality, and tops-onlyness, and the separable domain is maximal for these properties.
What carries the argument
The combination of false-name-proofness (immunity to multiple voting under different identities) and participation (immunity to abstention) under varying preference domains.
If this is right
- Any rule meeting both properties must treat voters symmetrically.
- Neutrality with respect to alternatives cannot hold on the universal domain.
- Separable preferences admit rules that are also onto, object neutral, and tops-only.
- No domain strictly containing the separable preferences allows all five properties simultaneously.
Where Pith is reading between the lines
- Designers facing unverifiable identities may need to restrict the allowable preference domain to separable orders to preserve both symmetry among voters and symmetry among objects.
- The maximality result indicates that attempts to work with richer preference domains will force the sacrifice of at least one of the listed axioms.
- Similar domain restrictions could be relevant for other mechanism-design problems in which identity verification is costly.
Load-bearing premise
That the relevant settings are either the universal domain of strict preferences or the separable domain over subsets of objects.
What would settle it
A voting rule on the universal domain of strict preferences that is false-name-proof and satisfies participation yet fails anonymity, or a strictly larger domain than separable preferences on which rules can still satisfy all five listed properties.
read the original abstract
We consider voting rules in settings where voters' identities are difficult to verify. Voters can manipulate the process by casting multiple votes under different identities or abstaining from voting. Immunities to such manipulations are called \emph{false-name-proofness} and \emph{participation}, respectively. For the universal domain of (strict) preferences, these properties together imply \emph{anonymity} and are incompatible with \emph{neutrality}. For the domain of preferences defined over all subsets of a given set of objects, both \emph{false-name-proofness} and \emph{participation} cannot be met by rules that are also \emph{onto}, \emph{object neutral}, and \emph{tops-only}. However, when preferences over subsets of objects are restricted to be separable, all these properties can be satisfied. Furthermore, the domain of separable preferences is maximal for these properties.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript examines voting rules satisfying false-name-proofness (immunity to multiple identities) and participation (no incentive to abstain). On the universal domain of strict preferences, these axioms imply anonymity and are incompatible with neutrality. On the domain of all preferences over subsets of objects, they are incompatible with onto, object-neutral, and tops-only rules. On the subdomain of separable preferences, rules satisfying all listed properties exist, and the separable domain is maximal for the combination of axioms.
Significance. If the derivations hold, the paper contributes to social choice theory by clarifying how domain restrictions enable positive results for voting rules under identity manipulation and abstention. The maximality claim for separable preferences is a notable strengthening of the possibility result, as it identifies the largest domain on which the axioms are compatible.
minor comments (2)
- The abstract states the maximality result but does not indicate whether the proof relies on a specific construction (e.g., a particular separable rule) or a general argument; a brief pointer in the introduction would help readers locate the relevant section.
- Notation for the separable domain and the listed axioms (false-name-proofness, participation, onto, object neutrality, tops-only) should be introduced with explicit definitions or references to standard definitions in the first section where they appear.
Simulated Author's Rebuttal
We thank the referee for the positive evaluation of the manuscript, the recognition of its contribution to social choice theory, and the recommendation for minor revision. We are pleased that the maximality result for separable preferences is viewed as a notable strengthening.
Circularity Check
No significant circularity identified
full rationale
The paper derives implications between standard axioms (false-name-proofness, participation, anonymity, neutrality, onto, object-neutrality, tops-only) on explicitly stated preference domains (universal strict, full subsets, separable subsets) using direct axiomatic arguments and maximality constructions. No equations, fitted parameters, self-definitional reductions, or load-bearing self-citations appear in the derivation chain; all results are self-contained within the stated domain restrictions and standard social-choice techniques.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Universal domain of strict preferences
- domain assumption Preferences defined over all subsets of objects, with separability restriction
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.