A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we axiomatize the ranking method that ranks the nodes according to their outdegree. This method generalizes the ranking by Copeland score for tournaments as characterized in Rubinstein (SIAM J. Appl. Math. 38 (1980) 108-111). © 2003 Elsevier B.V. All rights reserved.