The Outflow Ranking Method for Weighted Directed Graphs
Tinbergen Institute Discussion Paper No. 06-044/1
14 Pages Posted: 18 May 2006
Date Written: May 2006
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms. This outflow ranking method generalizes the ranking by outdegree for directed graphs. Furthermore, we compare our axioms with other axioms discussed in the literature.
Keywords: Decision analysis, Weighted directed graph, Ranking method
JEL Classification: C65, D71
Suggested Citation: Suggested Citation