Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/86591 
Year of Publication: 
2006
Series/Report no.: 
Tinbergen Institute Discussion Paper No. 06-044/1
Publisher: 
Tinbergen Institute, Amsterdam and Rotterdam
Abstract: 
A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed graphs.Furthermore, we compare our axioms with other axioms discussed in the literature.
Subjects: 
Decision analysis
Weighted directed graph
Ranking method
JEL: 
C65
D71
Document Type: 
Working Paper

Files in This Item:
File
Size
199.21 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.