The Outflow Ranking Method for Weighted Directed Graphs

A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed graphs.Furthermore, we compare our axioms with other axioms discussed in the literature.<P>This discussion paper has resulted in a publication in the <A href="http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VCT-4R8MDNW-3&_user=499884&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1036313442&_rerunOrigin=scholar.google&_acct=C000024499&_version=1&_urlVersion=0&_userid=499884&md5=5307d14961beb590b95642f1e2c5f249"><I>European Journal of Operational Research</I></A>, 193(2), 484-91.