Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
By generalizing the classical Knaster-Kuratowski-Mazurkiewicz Theorem, we obtain a result that provides sufficient conditions to ensure the non-emptiness of several kinds of choice functions. This result generalizes well-known results on the existence of maximal elements for binary relations (Bergstrom [4]; Walker [16]; Tian [15]), on the non-emptiness of non-binary choice functions (Nehring [12]; Llinares and Sánchez [9]) and on the non-emptiness of some classical solutions for tournaments (top cycle and uncovered set) on non-finite sets. Copyright Springer-Verlag Berlin Heidelberg 2003