Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We consider the problem of constructing strategy-proof rules that choose sets of alternatives based on the preferences of voters, modelled as Social Choice Correspondences (SCCs) in the literature. We focus on two domain restrictions inspired by Barberà et al. (2001) in the context of single-peaked utility functions. We find that for the narrower domain, the set of tops-only, unanimous, and strategy-proof SCCs coincides with the class of unions of two min–max rules (Moulin, 1980). For the broader domain, the set of SCCs coincides with the class of unions of two ‘adjacent’ min–max rules, meaning the corresponding parameters for the two rules must be either the same or consecutive alternatives.