Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
A (deterministic) social choice correspondence F, mapping states into outcomes, is rationalizably implementable provided that there exists a mechanism such that the support of its set of rationalizable outcomes coincides with the set of outcomes recommended by F. We provide a necessary condition for rationalizable implementation, called r-monotonicity. This condition, when combined with some other auxiliary conditions, is also sufficient when there are at least three agents.