The Degree Ratio Ranking Method for Directed Networks

René van den Brink () and Agnieszka Rusinowska
Additional contact information
René van den Brink: Department of Econometrics and Tinbergen Institute, VU University Amsterdam, https://personal.vu.nl/jrvanden.brink/

Documents de travail du Centre d'Economie de la Sorbonne from Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne

Abstract: One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node is ranked higher, the higher is its Copeland score. In this paper, we deal with an alternative to rank nodes according to their out– and indegree, namely ranking the nodes according to their degree ratio, i.e. the outdegree divided by the indegree. To avoid dividing by a zero indegree, we implicitly take the out– and indegree of the reflexive digraph. We provide an axiomatization of the ranking by degree ratio using a sibling neutrality axiom, which says that the entrance of a sibling (i.e. a node that is in some sense similar to the original node) does not change the ranking among the original nodes. We also provide a new axiomatization of the ranking by Copeland score using the same axioms except that this method satisfies a different sibling neutrality. Finally, we modify the ranking by degree ratio by not considering the reflexive digraph, but by definition assume nodes with indegree zero to be ranked higher than nodes with a positive indegree. We provide an axiomatization of this ranking by modified degree ratio using yet another sibling neutrality and a maximal property. In this way, we can compare the three ranking methods by their respective sibling neutrality

Keywords: group decisions and negotiations; directed graph; ranking method; degree ratio; Copeland score (search for similar items in EconPapers)
JEL-codes: C02 D71 D85 (search for similar items in EconPapers)
Pages: 26 pages
Date: 2019-05
New Economics Papers: this item is included in nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
ftp://mse.univ-paris1.fr/pub/mse/CES2019/19009.pdf (application/pdf)

Related works:
Working Paper: The Degree Ratio Ranking Method for Directed Networks (2019)
Working Paper: The Degree Ratio Ranking Method for Directed Networks (2019)
Working Paper: The Degree Ratio Ranking Method for Directed Networks
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mse:cesdoc:19009

Access Statistics for this paper

More papers in Documents de travail du Centre d'Economie de la Sorbonne from Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne Contact information at EDIRC.
Bibliographic data for series maintained by Lucie Label ().