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.
| Original language | English |
|---|---|
| Pages (from-to) | 484-491 |
| Number of pages | 8 |
| Journal | European Journal of Operational Research |
| Volume | 193 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 01 Mar 2009 |
ASJC Scopus subject areas
- Information Systems and Management
- Management Science and Operations Research
- Modelling and Simulation