Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We consider the problem of choosing one point in a set of alternatives when monetary transfers are possible. In this context, Schummer (2000) shows that a social choice function must be a constant function if manipulation through bribes is ruled out. But he requires two kinds of domain-richness conditions. One is either smooth connectedness or the finiteness of the set of alternatives and the other is monotonical closedness. However, dispensing with the former condition, we alternatively prove the same result under a weaker condition than monotonical closedness. Copyright Springer-Verlag Berlin Heidelberg 2003