Paper Info
Title
The outflow ranking method for weighted directed graphs
Abstract
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. Besides the well-known axioms of anonymity and positive responsiveness we introduce outflow monotonicity – meaning that in pairwise comparison between two nodes, a node is not doing worse in case its own outflow does not decrease and the other node’s outflow does not increase – and order preservation – meaning that adding two weighted digraphs such that the pairwise ranking between two nodes is the same in both weighted digraphs, then this is also their pairwise ranking in the ‘sum’ weighted digraph. The outflow ranking method generalizes the ranking by outdegree for directed graphs, and therefore also generalizes the ranking by Copeland score for tournaments.
Year
DOI
Venue
2009
10.1016/j.ejor.2007.11.051
European Journal of Operational Research
Keywords
Field
DocType
Decision analysis,Weighted directed graph,Ranking method,Outflow,Axiomatization
Discrete mathematics,Monotonic function,Pairwise comparison,Tournament,Combinatorics,Mathematical optimization,Ranking,Axiom,Directed graph,Outflow,Mathematics,Digraph
Journal
Volume
Issue
ISSN
193
2
0377-2217
Citations 
PageRank 
References 
6
0.48
2
Authors
2
Name
Order
Citations
PageRank
René Van Den Brink118727.06
Robert P. Gilles214423.11