On voting rules satisfying false-name-proofness and participation

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 false-name-proofness and participation , respectively. For the universal domain of (strict) preferences, these properties together imply anonymity and are incompatible with neutrality . For the domain of preferences defined over all subsets of a given set of objects, both false-name-proofness and participation cannot be met by rules that are also onto , object neutral , and 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.