Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
Abstract We show that a random rule on a top-connected single-peaked domain is unanimous and strategy-proof if and only if it is a random min–max rule. As a by-product of this result, it follows that a top-connected single-peaked domain is tops-only for random rules. We further provide a characterization of the random min–max domains.