Strategy-proofness on restricted separable domains

We study a problem in which a group of voters must decide which candidates are elected from a set of alternatives. The voters’ preferences on the combinations of elected candidates are represented by linear orderings. We propose a family of restrictions of the domain of separable preferences. These subdomains are generated from a partition that identifies the friends, enemies and unbiased candidates for each voter. We characterize the family of social choice functions that satisfy strategy-proofness and tops-onlyness properties on each of the subdomains. We find that these domain restrictions are not accompanied by an increase in the family of social choice functions satisfying the two properties.