The Outflow Ranking Method for Weighted Directed Graphs

Tinbergen Institute Discussion Paper No. 06-044/1

14 Pages Posted: 18 May 2006

See all articles by René van den Brink

René van den Brink

VU University Amsterdam - Department of Economics; Tinbergen Institute; Tinbergen Institute - Tinbergen Institute Amsterdam (TIA)

Robert P. Gilles

Queen's University Management School

Date Written: May 2006

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. 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

van den Brink, J.R. (René) and Gilles, Robert P., The Outflow Ranking Method for Weighted Directed Graphs (May 2006). Available at SSRN: https://ssrn.com/abstract=902816 or http://dx.doi.org/10.2139/ssrn.902816

J.R. (René) Van den Brink (Contact Author)

VU University Amsterdam - Department of Economics ( email )

De Boelelaan 1105
1081 HV Amsterdam
Netherlands

Tinbergen Institute ( email )

Burg. Oudlaan 50
Rotterdam, 3062 PA
Netherlands

Tinbergen Institute - Tinbergen Institute Amsterdam (TIA) ( email )

Gustav Mahlerplein 117
Amsterdam, 1082 MS
Netherlands

Robert P. Gilles

Queen's University Management School ( email )

25 University Sq
Belfast, Northern Ireland BT7 1NN
United Kingdom

Register to save articles to
your library

Register

Paper statistics

Downloads
61
Abstract Views
684
rank
354,144
PlumX Metrics