Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
The paper fully characterizes the class of Nash implementable social choice correspondences (SCCs) by mechanisms endowed with Saijo’s message space specification— $$s$$ -mechanisms. This class of SCCs is equivalent to the class of Nash implementable SCCs, though any game form involving ‘one less’ preference announcements breaks this equivalence relationship down. Copyright Springer-Verlag 2013